/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-lamport.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 04:13:47,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 04:13:47,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 04:13:47,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 04:13:47,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 04:13:47,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 04:13:47,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 04:13:47,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 04:13:47,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 04:13:47,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 04:13:47,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 04:13:47,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 04:13:47,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 04:13:47,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 04:13:47,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 04:13:48,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 04:13:48,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 04:13:48,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 04:13:48,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 04:13:48,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 04:13:48,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 04:13:48,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 04:13:48,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 04:13:48,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 04:13:48,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 04:13:48,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 04:13:48,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 04:13:48,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 04:13:48,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 04:13:48,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 04:13:48,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 04:13:48,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 04:13:48,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 04:13:48,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 04:13:48,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 04:13:48,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 04:13:48,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 04:13:48,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 04:13:48,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 04:13:48,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 04:13:48,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 04:13:48,034 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:13:48,056 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 04:13:48,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 04:13:48,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 04:13:48,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 04:13:48,058 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 04:13:48,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 04:13:48,059 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 04:13:48,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 04:13:48,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 04:13:48,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 04:13:48,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 04:13:48,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 04:13:48,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 04:13:48,060 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 04:13:48,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 04:13:48,061 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 04:13:48,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 04:13:48,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 04:13:48,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 04:13:48,061 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 04:13:48,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 04:13:48,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:13:48,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 04:13:48,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 04:13:48,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 04:13:48,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 04:13:48,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 04:13:48,065 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 04:13:48,066 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:13:48,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 04:13:48,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 04:13:48,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 04:13:48,345 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 04:13:48,346 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 04:13:48,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2022-12-13 04:13:49,234 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 04:13:49,416 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 04:13:49,417 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2022-12-13 04:13:49,429 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be44b8ab/02d2a27f9d9b4111b66311c5db0c774b/FLAG876713237 [2022-12-13 04:13:49,441 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be44b8ab/02d2a27f9d9b4111b66311c5db0c774b [2022-12-13 04:13:49,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 04:13:49,443 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 04:13:49,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 04:13:49,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 04:13:49,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 04:13:49,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:13:49" (1/1) ... [2022-12-13 04:13:49,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a285090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:49, skipping insertion in model container [2022-12-13 04:13:49,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:13:49" (1/1) ... [2022-12-13 04:13:49,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 04:13:49,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 04:13:49,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,625 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-lamport.wvr.c[4210,4223] [2022-12-13 04:13:49,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:13:49,645 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 04:13:49,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:13:49,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:13:49,690 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-lamport.wvr.c[4210,4223] [2022-12-13 04:13:49,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:13:49,701 INFO L208 MainTranslator]: Completed translation [2022-12-13 04:13:49,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:49 WrapperNode [2022-12-13 04:13:49,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 04:13:49,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 04:13:49,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 04:13:49,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 04:13:49,708 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:13:49" (1/1) ... [2022-12-13 04:13:49,723 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:13:49" (1/1) ... [2022-12-13 04:13:49,749 INFO L138 Inliner]: procedures = 25, calls = 89, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 235 [2022-12-13 04:13:49,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 04:13:49,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 04:13:49,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 04:13:49,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 04:13:49,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:49" (1/1) ... [2022-12-13 04:13:49,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:49" (1/1) ... [2022-12-13 04:13:49,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:49" (1/1) ... [2022-12-13 04:13:49,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:49" (1/1) ... [2022-12-13 04:13:49,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:49" (1/1) ... [2022-12-13 04:13:49,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:49" (1/1) ... [2022-12-13 04:13:49,777 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:49" (1/1) ... [2022-12-13 04:13:49,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:49" (1/1) ... [2022-12-13 04:13:49,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 04:13:49,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 04:13:49,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 04:13:49,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 04:13:49,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:49" (1/1) ... [2022-12-13 04:13:49,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:13:49,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:13:49,820 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:13:49,826 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:13:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 04:13:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 04:13:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 04:13:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 04:13:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 04:13:49,851 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 04:13:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 04:13:49,851 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 04:13:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 04:13:49,851 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 04:13:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 04:13:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 04:13:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 04:13:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 04:13:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 04:13:49,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 04:13:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 04:13:49,853 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:13:49,985 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 04:13:49,986 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 04:13:50,260 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 04:13:50,324 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 04:13:50,324 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 04:13:50,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:13:50 BoogieIcfgContainer [2022-12-13 04:13:50,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 04:13:50,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 04:13:50,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 04:13:50,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 04:13:50,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:13:49" (1/3) ... [2022-12-13 04:13:50,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542856eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:13:50, skipping insertion in model container [2022-12-13 04:13:50,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:49" (2/3) ... [2022-12-13 04:13:50,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542856eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:13:50, skipping insertion in model container [2022-12-13 04:13:50,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:13:50" (3/3) ... [2022-12-13 04:13:50,331 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2022-12-13 04:13:50,342 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 04:13:50,342 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 04:13:50,342 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 04:13:50,408 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 04:13:50,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 172 transitions, 368 flow [2022-12-13 04:13:50,491 INFO L130 PetriNetUnfolder]: 7/169 cut-off events. [2022-12-13 04:13:50,491 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 04:13:50,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 169 events. 7/169 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-13 04:13:50,495 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 172 transitions, 368 flow [2022-12-13 04:13:50,498 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 159 transitions, 336 flow [2022-12-13 04:13:50,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:13:50,514 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 159 transitions, 336 flow [2022-12-13 04:13:50,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 159 transitions, 336 flow [2022-12-13 04:13:50,583 INFO L130 PetriNetUnfolder]: 7/159 cut-off events. [2022-12-13 04:13:50,583 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 04:13:50,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 159 events. 7/159 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-13 04:13:50,586 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 159 transitions, 336 flow [2022-12-13 04:13:50,586 INFO L226 LiptonReduction]: Number of co-enabled transitions 1266 [2022-12-13 04:13:55,641 INFO L241 LiptonReduction]: Total number of compositions: 127 [2022-12-13 04:13:55,652 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 04:13:55,656 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;@3387a779, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 04:13:55,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 04:13:55,673 INFO L130 PetriNetUnfolder]: 1/31 cut-off events. [2022-12-13 04:13:55,673 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 04:13:55,673 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:13:55,674 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] [2022-12-13 04:13:55,674 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 1 more)] === [2022-12-13 04:13:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:13:55,678 INFO L85 PathProgramCache]: Analyzing trace with hash -694790440, now seen corresponding path program 1 times [2022-12-13 04:13:55,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:13:55,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853760385] [2022-12-13 04:13:55,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:13:55,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:13:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:13:56,131 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:13:56,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:13:56,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853760385] [2022-12-13 04:13:56,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853760385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:13:56,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:13:56,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 04:13:56,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628582337] [2022-12-13 04:13:56,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:13:56,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 04:13:56,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:13:56,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 04:13:56,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 04:13:56,155 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:13:56,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:13:56,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:13:56,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:13:56,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:13:56,355 INFO L130 PetriNetUnfolder]: 934/1483 cut-off events. [2022-12-13 04:13:56,356 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-13 04:13:56,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3174 conditions, 1483 events. 934/1483 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5866 event pairs, 933 based on Foata normal form. 0/1482 useless extension candidates. Maximal degree in co-relation 2948. Up to 1483 conditions per place. [2022-12-13 04:13:56,365 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 31 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-13 04:13:56,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 150 flow [2022-12-13 04:13:56,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 04:13:56,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 04:13:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 04:13:56,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-13 04:13:56,376 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2022-12-13 04:13:56,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 33 transitions, 150 flow [2022-12-13 04:13:56,380 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 150 flow [2022-12-13 04:13:56,383 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:13:56,384 INFO L89 Accepts]: Start accepts. Operand has 43 places, 33 transitions, 150 flow [2022-12-13 04:13:56,387 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:13:56,387 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:13:56,387 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 150 flow [2022-12-13 04:13:56,391 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 150 flow [2022-12-13 04:13:56,391 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:13:57,735 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:13:57,737 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1354 [2022-12-13 04:13:57,737 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 146 flow [2022-12-13 04:13:57,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:13:57,738 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:13:57,738 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] [2022-12-13 04:13:57,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 04:13:57,741 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 1 more)] === [2022-12-13 04:13:57,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:13:57,741 INFO L85 PathProgramCache]: Analyzing trace with hash 274489270, now seen corresponding path program 1 times [2022-12-13 04:13:57,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:13:57,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118429015] [2022-12-13 04:13:57,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:13:57,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:13:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:13:58,006 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:13:58,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:13:58,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118429015] [2022-12-13 04:13:58,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118429015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:13:58,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:13:58,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:13:58,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929187896] [2022-12-13 04:13:58,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:13:58,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:13:58,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:13:58,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:13:58,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:13:58,009 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-13 04:13:58,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 146 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:13:58,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:13:58,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-13 04:13:58,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:13:58,393 INFO L130 PetriNetUnfolder]: 1736/2762 cut-off events. [2022-12-13 04:13:58,393 INFO L131 PetriNetUnfolder]: For 477/477 co-relation queries the response was YES. [2022-12-13 04:13:58,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8434 conditions, 2762 events. 1736/2762 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 13346 event pairs, 385 based on Foata normal form. 36/2797 useless extension candidates. Maximal degree in co-relation 8242. Up to 2763 conditions per place. [2022-12-13 04:13:58,405 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 101 selfloop transitions, 16 changer transitions 0/119 dead transitions. [2022-12-13 04:13:58,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 119 transitions, 770 flow [2022-12-13 04:13:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:13:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:13:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2022-12-13 04:13:58,409 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-13 04:13:58,409 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2022-12-13 04:13:58,410 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 119 transitions, 770 flow [2022-12-13 04:13:58,418 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 119 transitions, 770 flow [2022-12-13 04:13:58,427 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:13:58,428 INFO L89 Accepts]: Start accepts. Operand has 50 places, 119 transitions, 770 flow [2022-12-13 04:13:58,429 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:13:58,429 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:13:58,429 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 119 transitions, 770 flow [2022-12-13 04:13:58,431 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 119 transitions, 770 flow [2022-12-13 04:13:58,431 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:13:58,584 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:13:58,585 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-13 04:13:58,585 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 119 transitions, 770 flow [2022-12-13 04:13:58,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:13:58,585 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:13:58,586 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] [2022-12-13 04:13:58,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 04:13:58,586 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 1 more)] === [2022-12-13 04:13:58,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:13:58,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1899671102, now seen corresponding path program 2 times [2022-12-13 04:13:58,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:13:58,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812842478] [2022-12-13 04:13:58,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:13:58,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:13:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:13:59,117 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:13:59,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:13:59,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812842478] [2022-12-13 04:13:59,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812842478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:13:59,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:13:59,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:13:59,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22290047] [2022-12-13 04:13:59,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:13:59,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:13:59,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:13:59,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:13:59,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:13:59,119 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:13:59,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 119 transitions, 770 flow. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:13:59,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:13:59,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:13:59,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:14:00,255 INFO L130 PetriNetUnfolder]: 4244/6810 cut-off events. [2022-12-13 04:14:00,255 INFO L131 PetriNetUnfolder]: For 907/907 co-relation queries the response was YES. [2022-12-13 04:14:00,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27725 conditions, 6810 events. 4244/6810 cut-off events. For 907/907 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 39152 event pairs, 278 based on Foata normal form. 2/6810 useless extension candidates. Maximal degree in co-relation 16160. Up to 6811 conditions per place. [2022-12-13 04:14:00,290 INFO L137 encePairwiseOnDemand]: 22/36 looper letters, 552 selfloop transitions, 116 changer transitions 56/724 dead transitions. [2022-12-13 04:14:00,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 724 transitions, 6100 flow [2022-12-13 04:14:00,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 04:14:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 04:14:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 226 transitions. [2022-12-13 04:14:00,293 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44841269841269843 [2022-12-13 04:14:00,293 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2022-12-13 04:14:00,293 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 724 transitions, 6100 flow [2022-12-13 04:14:00,319 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 668 transitions, 5630 flow [2022-12-13 04:14:00,343 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:14:00,344 INFO L89 Accepts]: Start accepts. Operand has 61 places, 668 transitions, 5630 flow [2022-12-13 04:14:00,346 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:14:00,346 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:14:00,346 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 668 transitions, 5630 flow [2022-12-13 04:14:00,360 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 668 transitions, 5630 flow [2022-12-13 04:14:00,360 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:14:00,362 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:14:00,363 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 04:14:00,363 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 668 transitions, 5630 flow [2022-12-13 04:14:00,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:00,363 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:14:00,363 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] [2022-12-13 04:14:00,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 04:14:00,364 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 1 more)] === [2022-12-13 04:14:00,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:14:00,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2141260242, now seen corresponding path program 1 times [2022-12-13 04:14:00,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:14:00,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049683387] [2022-12-13 04:14:00,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:14:00,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:14:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:14:00,547 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:14:00,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:14:00,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049683387] [2022-12-13 04:14:00,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049683387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:14:00,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:14:00,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:14:00,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296037144] [2022-12-13 04:14:00,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:14:00,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:14:00,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:14:00,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:14:00,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:14:00,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-13 04:14:00,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 668 transitions, 5630 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:00,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:14:00,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-13 04:14:00,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:14:01,772 INFO L130 PetriNetUnfolder]: 6049/9776 cut-off events. [2022-12-13 04:14:01,773 INFO L131 PetriNetUnfolder]: For 2531/2531 co-relation queries the response was YES. [2022-12-13 04:14:01,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49054 conditions, 9776 events. 6049/9776 cut-off events. For 2531/2531 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 60854 event pairs, 360 based on Foata normal form. 72/9846 useless extension candidates. Maximal degree in co-relation 28391. Up to 9777 conditions per place. [2022-12-13 04:14:01,820 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 1045 selfloop transitions, 86 changer transitions 0/1144 dead transitions. [2022-12-13 04:14:01,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 1144 transitions, 11946 flow [2022-12-13 04:14:01,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:14:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:14:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 154 transitions. [2022-12-13 04:14:01,821 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 04:14:01,822 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2022-12-13 04:14:01,822 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 1144 transitions, 11946 flow [2022-12-13 04:14:01,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 1144 transitions, 11946 flow [2022-12-13 04:14:01,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:14:01,909 INFO L89 Accepts]: Start accepts. Operand has 71 places, 1144 transitions, 11946 flow [2022-12-13 04:14:01,914 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:14:01,915 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:14:01,915 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 1144 transitions, 11946 flow [2022-12-13 04:14:01,943 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 1144 transitions, 11946 flow [2022-12-13 04:14:01,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:14:01,948 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:14:01,949 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 04:14:01,949 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 1144 transitions, 11946 flow [2022-12-13 04:14:01,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:01,950 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:14:01,950 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] [2022-12-13 04:14:01,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 04:14:01,950 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 1 more)] === [2022-12-13 04:14:01,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:14:01,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1950263075, now seen corresponding path program 1 times [2022-12-13 04:14:01,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:14:01,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566048533] [2022-12-13 04:14:01,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:14:01,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:14:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:14:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:14:02,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:14:02,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566048533] [2022-12-13 04:14:02,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566048533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:14:02,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:14:02,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:14:02,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743182901] [2022-12-13 04:14:02,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:14:02,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 04:14:02,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:14:02,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 04:14:02,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-13 04:14:02,804 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:14:02,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 1144 transitions, 11946 flow. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:02,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:14:02,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:14:02,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:14:07,228 INFO L130 PetriNetUnfolder]: 9644/16646 cut-off events. [2022-12-13 04:14:07,239 INFO L131 PetriNetUnfolder]: For 3699/3699 co-relation queries the response was YES. [2022-12-13 04:14:07,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100863 conditions, 16646 events. 9644/16646 cut-off events. For 3699/3699 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 124351 event pairs, 337 based on Foata normal form. 32/16676 useless extension candidates. Maximal degree in co-relation 73998. Up to 16647 conditions per place. [2022-12-13 04:14:07,308 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 1819 selfloop transitions, 400 changer transitions 1172/3391 dead transitions. [2022-12-13 04:14:07,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 3391 transitions, 42513 flow [2022-12-13 04:14:07,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 04:14:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-13 04:14:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 453 transitions. [2022-12-13 04:14:07,311 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3813131313131313 [2022-12-13 04:14:07,311 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 62 predicate places. [2022-12-13 04:14:07,311 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 3391 transitions, 42513 flow [2022-12-13 04:14:07,367 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 2219 transitions, 27808 flow [2022-12-13 04:14:07,456 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:14:07,456 INFO L89 Accepts]: Start accepts. Operand has 96 places, 2219 transitions, 27808 flow [2022-12-13 04:14:07,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:14:07,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:14:07,465 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 2219 transitions, 27808 flow [2022-12-13 04:14:07,566 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 2219 transitions, 27808 flow [2022-12-13 04:14:07,566 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:14:07,573 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:14:07,573 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 04:14:07,573 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 2219 transitions, 27808 flow [2022-12-13 04:14:07,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:07,574 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:14:07,574 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] [2022-12-13 04:14:07,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 04:14:07,574 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 1 more)] === [2022-12-13 04:14:07,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:14:07,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1158365634, now seen corresponding path program 1 times [2022-12-13 04:14:07,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:14:07,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429824278] [2022-12-13 04:14:07,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:14:07,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:14:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:14:08,076 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:14:08,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:14:08,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429824278] [2022-12-13 04:14:08,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429824278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:14:08,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:14:08,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:14:08,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907124231] [2022-12-13 04:14:08,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:14:08,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:14:08,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:14:08,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:14:08,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:14:08,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:14:08,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 2219 transitions, 27808 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:08,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:14:08,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:14:08,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:14:11,188 INFO L130 PetriNetUnfolder]: 7480/12853 cut-off events. [2022-12-13 04:14:11,188 INFO L131 PetriNetUnfolder]: For 2980/2980 co-relation queries the response was YES. [2022-12-13 04:14:11,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90760 conditions, 12853 events. 7480/12853 cut-off events. For 2980/2980 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 91018 event pairs, 257 based on Foata normal form. 48/12899 useless extension candidates. Maximal degree in co-relation 60213. Up to 12854 conditions per place. [2022-12-13 04:14:11,230 INFO L137 encePairwiseOnDemand]: 23/36 looper letters, 343 selfloop transitions, 2 changer transitions 2470/2815 dead transitions. [2022-12-13 04:14:11,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 2815 transitions, 41024 flow [2022-12-13 04:14:11,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:14:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:14:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2022-12-13 04:14:11,234 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.503968253968254 [2022-12-13 04:14:11,236 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places. [2022-12-13 04:14:11,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 2815 transitions, 41024 flow [2022-12-13 04:14:11,263 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 345 transitions, 4976 flow [2022-12-13 04:14:11,310 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:14:11,310 INFO L89 Accepts]: Start accepts. Operand has 68 places, 345 transitions, 4976 flow [2022-12-13 04:14:11,313 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:14:11,313 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:14:11,313 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 345 transitions, 4976 flow [2022-12-13 04:14:11,324 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 345 transitions, 4976 flow [2022-12-13 04:14:11,324 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:14:12,901 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:14:12,903 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1593 [2022-12-13 04:14:12,912 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 344 transitions, 4962 flow [2022-12-13 04:14:12,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:12,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:14:12,913 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] [2022-12-13 04:14:12,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 04:14:12,913 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 1 more)] === [2022-12-13 04:14:12,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:14:12,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1918965092, now seen corresponding path program 1 times [2022-12-13 04:14:12,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:14:12,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073692980] [2022-12-13 04:14:12,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:14:12,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:14:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:14:13,460 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:14:13,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:14:13,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073692980] [2022-12-13 04:14:13,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073692980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:14:13,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:14:13,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:14:13,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608155116] [2022-12-13 04:14:13,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:14:13,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:14:13,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:14:13,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:14:13,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:14:13,462 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:14:13,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 344 transitions, 4962 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:13,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:14:13,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:14:13,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:14:14,919 INFO L130 PetriNetUnfolder]: 6221/10122 cut-off events. [2022-12-13 04:14:14,919 INFO L131 PetriNetUnfolder]: For 2497/2497 co-relation queries the response was YES. [2022-12-13 04:14:14,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81110 conditions, 10122 events. 6221/10122 cut-off events. For 2497/2497 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 64143 event pairs, 328 based on Foata normal form. 4/10124 useless extension candidates. Maximal degree in co-relation 47625. Up to 10123 conditions per place. [2022-12-13 04:14:14,965 INFO L137 encePairwiseOnDemand]: 22/36 looper letters, 892 selfloop transitions, 149 changer transitions 122/1163 dead transitions. [2022-12-13 04:14:14,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 1163 transitions, 19176 flow [2022-12-13 04:14:14,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:14:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:14:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2022-12-13 04:14:14,967 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4823232323232323 [2022-12-13 04:14:14,967 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places. [2022-12-13 04:14:14,967 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 1163 transitions, 19176 flow [2022-12-13 04:14:15,008 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 1041 transitions, 17171 flow [2022-12-13 04:14:15,044 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:14:15,044 INFO L89 Accepts]: Start accepts. Operand has 73 places, 1041 transitions, 17171 flow [2022-12-13 04:14:15,049 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:14:15,050 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:14:15,050 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 1041 transitions, 17171 flow [2022-12-13 04:14:15,071 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 1041 transitions, 17171 flow [2022-12-13 04:14:15,071 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:14:15,075 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:14:15,075 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 04:14:15,075 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 1041 transitions, 17171 flow [2022-12-13 04:14:15,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:15,076 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:14:15,076 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] [2022-12-13 04:14:15,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 04:14:15,076 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 1 more)] === [2022-12-13 04:14:15,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:14:15,076 INFO L85 PathProgramCache]: Analyzing trace with hash 2115434795, now seen corresponding path program 1 times [2022-12-13 04:14:15,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:14:15,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482292630] [2022-12-13 04:14:15,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:14:15,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:14:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:14:15,561 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:14:15,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:14:15,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482292630] [2022-12-13 04:14:15,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482292630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:14:15,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:14:15,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:14:15,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226435220] [2022-12-13 04:14:15,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:14:15,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:14:15,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:14:15,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:14:15,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:14:15,564 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:14:15,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 1041 transitions, 17171 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:15,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:14:15,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:14:15,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:14:17,915 INFO L130 PetriNetUnfolder]: 6755/11108 cut-off events. [2022-12-13 04:14:17,916 INFO L131 PetriNetUnfolder]: For 2680/2680 co-relation queries the response was YES. [2022-12-13 04:14:17,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100421 conditions, 11108 events. 6755/11108 cut-off events. For 2680/2680 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 72207 event pairs, 390 based on Foata normal form. 4/11110 useless extension candidates. Maximal degree in co-relation 62110. Up to 11109 conditions per place. [2022-12-13 04:14:17,972 INFO L137 encePairwiseOnDemand]: 20/36 looper letters, 1262 selfloop transitions, 247 changer transitions 77/1586 dead transitions. [2022-12-13 04:14:17,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 1586 transitions, 29430 flow [2022-12-13 04:14:17,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 04:14:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 04:14:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 218 transitions. [2022-12-13 04:14:17,973 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4658119658119658 [2022-12-13 04:14:17,974 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2022-12-13 04:14:17,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 1586 transitions, 29430 flow [2022-12-13 04:14:18,027 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 1509 transitions, 27990 flow [2022-12-13 04:14:18,075 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:14:18,075 INFO L89 Accepts]: Start accepts. Operand has 84 places, 1509 transitions, 27990 flow [2022-12-13 04:14:18,082 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:14:18,082 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:14:18,082 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 1509 transitions, 27990 flow [2022-12-13 04:14:18,106 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 1509 transitions, 27990 flow [2022-12-13 04:14:18,107 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:14:18,112 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:14:18,113 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 04:14:18,113 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 1509 transitions, 27990 flow [2022-12-13 04:14:18,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:18,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:14:18,113 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] [2022-12-13 04:14:18,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 04:14:18,113 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 1 more)] === [2022-12-13 04:14:18,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:14:18,114 INFO L85 PathProgramCache]: Analyzing trace with hash -305079435, now seen corresponding path program 2 times [2022-12-13 04:14:18,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:14:18,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564954911] [2022-12-13 04:14:18,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:14:18,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:14:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:14:18,695 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:14:18,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:14:18,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564954911] [2022-12-13 04:14:18,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564954911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:14:18,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:14:18,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:14:18,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347653910] [2022-12-13 04:14:18,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:14:18,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:14:18,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:14:18,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:14:18,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:14:18,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:14:18,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 1509 transitions, 27990 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:18,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:14:18,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:14:18,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:14:21,761 INFO L130 PetriNetUnfolder]: 7033/11564 cut-off events. [2022-12-13 04:14:21,761 INFO L131 PetriNetUnfolder]: For 2740/2740 co-relation queries the response was YES. [2022-12-13 04:14:21,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116178 conditions, 11564 events. 7033/11564 cut-off events. For 2740/2740 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 75916 event pairs, 402 based on Foata normal form. 8/11570 useless extension candidates. Maximal degree in co-relation 73489. Up to 11565 conditions per place. [2022-12-13 04:14:21,830 INFO L137 encePairwiseOnDemand]: 20/36 looper letters, 1173 selfloop transitions, 275 changer transitions 256/1704 dead transitions. [2022-12-13 04:14:21,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 1704 transitions, 35052 flow [2022-12-13 04:14:21,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:14:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:14:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 214 transitions. [2022-12-13 04:14:21,832 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49537037037037035 [2022-12-13 04:14:21,832 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 54 predicate places. [2022-12-13 04:14:21,832 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 1704 transitions, 35052 flow [2022-12-13 04:14:21,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 1448 transitions, 29659 flow [2022-12-13 04:14:21,974 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:14:21,974 INFO L89 Accepts]: Start accepts. Operand has 94 places, 1448 transitions, 29659 flow [2022-12-13 04:14:21,985 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:14:21,985 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:14:21,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 1448 transitions, 29659 flow [2022-12-13 04:14:22,011 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 1448 transitions, 29659 flow [2022-12-13 04:14:22,011 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:14:22,016 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:14:22,017 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 04:14:22,017 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 1448 transitions, 29659 flow [2022-12-13 04:14:22,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:22,018 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:14:22,018 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] [2022-12-13 04:14:22,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 04:14:22,018 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 1 more)] === [2022-12-13 04:14:22,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:14:22,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1072262277, now seen corresponding path program 3 times [2022-12-13 04:14:22,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:14:22,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656305217] [2022-12-13 04:14:22,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:14:22,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:14:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:14:22,473 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:14:22,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:14:22,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656305217] [2022-12-13 04:14:22,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656305217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:14:22,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:14:22,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:14:22,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727047326] [2022-12-13 04:14:22,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:14:22,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:14:22,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:14:22,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:14:22,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:14:22,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:14:22,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 1448 transitions, 29659 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:22,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:14:22,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:14:22,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:14:25,805 INFO L130 PetriNetUnfolder]: 7032/11869 cut-off events. [2022-12-13 04:14:25,805 INFO L131 PetriNetUnfolder]: For 2766/2766 co-relation queries the response was YES. [2022-12-13 04:14:25,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130913 conditions, 11869 events. 7032/11869 cut-off events. For 2766/2766 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 81343 event pairs, 427 based on Foata normal form. 4/11871 useless extension candidates. Maximal degree in co-relation 84090. Up to 11870 conditions per place. [2022-12-13 04:14:25,873 INFO L137 encePairwiseOnDemand]: 20/36 looper letters, 1396 selfloop transitions, 212 changer transitions 147/1755 dead transitions. [2022-12-13 04:14:25,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 1755 transitions, 39444 flow [2022-12-13 04:14:25,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:14:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:14:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 205 transitions. [2022-12-13 04:14:25,875 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47453703703703703 [2022-12-13 04:14:25,875 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2022-12-13 04:14:25,875 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 1755 transitions, 39444 flow [2022-12-13 04:14:25,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 1608 transitions, 36142 flow [2022-12-13 04:14:26,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:14:26,006 INFO L89 Accepts]: Start accepts. Operand has 103 places, 1608 transitions, 36142 flow [2022-12-13 04:14:26,014 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:14:26,014 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:14:26,014 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 1608 transitions, 36142 flow [2022-12-13 04:14:26,035 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 1608 transitions, 36142 flow [2022-12-13 04:14:26,035 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:14:26,040 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:14:26,041 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 04:14:26,041 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 1608 transitions, 36142 flow [2022-12-13 04:14:26,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:26,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:14:26,041 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] [2022-12-13 04:14:26,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 04:14:26,041 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 1 more)] === [2022-12-13 04:14:26,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:14:26,042 INFO L85 PathProgramCache]: Analyzing trace with hash -606948235, now seen corresponding path program 4 times [2022-12-13 04:14:26,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:14:26,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247887292] [2022-12-13 04:14:26,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:14:26,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:14:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:14:26,574 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:14:26,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:14:26,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247887292] [2022-12-13 04:14:26,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247887292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:14:26,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:14:26,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:14:26,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998211971] [2022-12-13 04:14:26,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:14:26,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:14:26,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:14:26,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:14:26,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:14:26,576 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:14:26,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 1608 transitions, 36142 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:26,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:14:26,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:14:26,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:14:30,250 INFO L130 PetriNetUnfolder]: 7180/12315 cut-off events. [2022-12-13 04:14:30,250 INFO L131 PetriNetUnfolder]: For 2831/2831 co-relation queries the response was YES. [2022-12-13 04:14:30,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148157 conditions, 12315 events. 7180/12315 cut-off events. For 2831/2831 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 86909 event pairs, 405 based on Foata normal form. 4/12317 useless extension candidates. Maximal degree in co-relation 96680. Up to 12316 conditions per place. [2022-12-13 04:14:30,329 INFO L137 encePairwiseOnDemand]: 22/36 looper letters, 1695 selfloop transitions, 111 changer transitions 173/1979 dead transitions. [2022-12-13 04:14:30,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 1979 transitions, 48389 flow [2022-12-13 04:14:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:14:30,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:14:30,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 189 transitions. [2022-12-13 04:14:30,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-13 04:14:30,331 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 73 predicate places. [2022-12-13 04:14:30,331 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 1979 transitions, 48389 flow [2022-12-13 04:14:30,408 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 1806 transitions, 44169 flow [2022-12-13 04:14:30,471 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:14:30,471 INFO L89 Accepts]: Start accepts. Operand has 112 places, 1806 transitions, 44169 flow [2022-12-13 04:14:30,481 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:14:30,481 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:14:30,481 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 1806 transitions, 44169 flow [2022-12-13 04:14:30,504 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 1806 transitions, 44169 flow [2022-12-13 04:14:30,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:14:30,510 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:14:30,511 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 04:14:30,511 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 1806 transitions, 44169 flow [2022-12-13 04:14:30,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:30,511 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:14:30,511 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] [2022-12-13 04:14:30,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 04:14:30,512 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 1 more)] === [2022-12-13 04:14:30,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:14:30,512 INFO L85 PathProgramCache]: Analyzing trace with hash 270671057, now seen corresponding path program 5 times [2022-12-13 04:14:30,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:14:30,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345688197] [2022-12-13 04:14:30,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:14:30,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:14:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:14:32,951 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:14:32,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:14:32,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345688197] [2022-12-13 04:14:32,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345688197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:14:32,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:14:32,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 04:14:32,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403083158] [2022-12-13 04:14:32,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:14:32,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 04:14:32,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:14:32,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 04:14:32,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-13 04:14:32,952 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:14:32,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 1806 transitions, 44169 flow. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:32,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:14:32,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:14:32,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:14:37,567 INFO L130 PetriNetUnfolder]: 7371/12735 cut-off events. [2022-12-13 04:14:37,567 INFO L131 PetriNetUnfolder]: For 2972/2972 co-relation queries the response was YES. [2022-12-13 04:14:37,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166136 conditions, 12735 events. 7371/12735 cut-off events. For 2972/2972 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 91099 event pairs, 351 based on Foata normal form. 4/12737 useless extension candidates. Maximal degree in co-relation 107733. Up to 12736 conditions per place. [2022-12-13 04:14:37,636 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 1843 selfloop transitions, 269 changer transitions 53/2165 dead transitions. [2022-12-13 04:14:37,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 2165 transitions, 57389 flow [2022-12-13 04:14:37,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 04:14:37,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 04:14:37,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 214 transitions. [2022-12-13 04:14:37,638 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45726495726495725 [2022-12-13 04:14:37,638 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 83 predicate places. [2022-12-13 04:14:37,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 2165 transitions, 57389 flow [2022-12-13 04:14:37,710 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 2112 transitions, 55966 flow [2022-12-13 04:14:37,769 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:14:37,769 INFO L89 Accepts]: Start accepts. Operand has 123 places, 2112 transitions, 55966 flow [2022-12-13 04:14:37,782 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:14:37,782 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:14:37,782 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 2112 transitions, 55966 flow [2022-12-13 04:14:37,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 2112 transitions, 55966 flow [2022-12-13 04:14:37,812 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:14:37,816 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:14:37,817 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 04:14:37,817 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 2112 transitions, 55966 flow [2022-12-13 04:14:37,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:37,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:14:37,817 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] [2022-12-13 04:14:37,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 04:14:37,817 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 1 more)] === [2022-12-13 04:14:37,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:14:37,818 INFO L85 PathProgramCache]: Analyzing trace with hash -464795963, now seen corresponding path program 6 times [2022-12-13 04:14:37,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:14:37,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209026703] [2022-12-13 04:14:37,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:14:37,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:14:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:14:38,269 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:14:38,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:14:38,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209026703] [2022-12-13 04:14:38,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209026703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:14:38,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:14:38,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:14:38,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840310516] [2022-12-13 04:14:38,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:14:38,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:14:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:14:38,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:14:38,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:14:38,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:14:38,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 2112 transitions, 55966 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:38,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:14:38,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:14:38,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:14:43,336 INFO L130 PetriNetUnfolder]: 7605/13365 cut-off events. [2022-12-13 04:14:43,337 INFO L131 PetriNetUnfolder]: For 3230/3230 co-relation queries the response was YES. [2022-12-13 04:14:43,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187728 conditions, 13365 events. 7605/13365 cut-off events. For 3230/3230 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 98679 event pairs, 360 based on Foata normal form. 4/13367 useless extension candidates. Maximal degree in co-relation 124375. Up to 13366 conditions per place. [2022-12-13 04:14:43,421 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 1971 selfloop transitions, 272 changer transitions 109/2352 dead transitions. [2022-12-13 04:14:43,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 2352 transitions, 67053 flow [2022-12-13 04:14:43,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:14:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:14:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 208 transitions. [2022-12-13 04:14:43,422 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2022-12-13 04:14:43,423 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 93 predicate places. [2022-12-13 04:14:43,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 2352 transitions, 67053 flow [2022-12-13 04:14:43,513 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 2243 transitions, 63948 flow [2022-12-13 04:14:43,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:14:43,588 INFO L89 Accepts]: Start accepts. Operand has 132 places, 2243 transitions, 63948 flow [2022-12-13 04:14:43,602 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:14:43,602 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:14:43,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 2243 transitions, 63948 flow [2022-12-13 04:14:43,638 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 2243 transitions, 63948 flow [2022-12-13 04:14:43,638 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:14:43,644 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:14:43,645 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 04:14:43,645 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 2243 transitions, 63948 flow [2022-12-13 04:14:43,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:43,645 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:14:43,645 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] [2022-12-13 04:14:43,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 04:14:43,645 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 1 more)] === [2022-12-13 04:14:43,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:14:43,645 INFO L85 PathProgramCache]: Analyzing trace with hash -602828677, now seen corresponding path program 7 times [2022-12-13 04:14:43,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:14:43,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129763594] [2022-12-13 04:14:43,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:14:43,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:14:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:14:44,295 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:14:44,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:14:44,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129763594] [2022-12-13 04:14:44,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129763594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:14:44,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:14:44,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:14:44,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696863084] [2022-12-13 04:14:44,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:14:44,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:14:44,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:14:44,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:14:44,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:14:44,297 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:14:44,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 2243 transitions, 63948 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:44,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:14:44,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:14:44,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:14:49,886 INFO L130 PetriNetUnfolder]: 7949/14102 cut-off events. [2022-12-13 04:14:49,886 INFO L131 PetriNetUnfolder]: For 3373/3373 co-relation queries the response was YES. [2022-12-13 04:14:49,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212320 conditions, 14102 events. 7949/14102 cut-off events. For 3373/3373 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 106335 event pairs, 341 based on Foata normal form. 8/14108 useless extension candidates. Maximal degree in co-relation 143769. Up to 14103 conditions per place. [2022-12-13 04:14:49,986 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 2107 selfloop transitions, 275 changer transitions 228/2610 dead transitions. [2022-12-13 04:14:49,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 2610 transitions, 79705 flow [2022-12-13 04:14:49,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 04:14:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 04:14:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 225 transitions. [2022-12-13 04:14:49,988 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2022-12-13 04:14:49,988 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 104 predicate places. [2022-12-13 04:14:49,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 2610 transitions, 79705 flow [2022-12-13 04:14:50,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 2382 transitions, 72712 flow [2022-12-13 04:14:50,203 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:14:50,204 INFO L89 Accepts]: Start accepts. Operand has 144 places, 2382 transitions, 72712 flow [2022-12-13 04:14:50,219 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:14:50,220 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:14:50,220 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 2382 transitions, 72712 flow [2022-12-13 04:14:50,263 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 2382 transitions, 72712 flow [2022-12-13 04:14:50,264 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:14:50,282 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [506] L71-->L74: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= (ite (and (<= 0 v_~i~0_32) (< v_~i~0_32 v_~n~0_22)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|)) InVars {~n~0=v_~n~0_22, ~i~0=v_~i~0_32} OutVars{~n~0=v_~n~0_22, ~i~0=v_~i~0_32, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 04:14:50,329 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:14:50,357 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [506] L71-->L74: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= (ite (and (<= 0 v_~i~0_32) (< v_~i~0_32 v_~n~0_22)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|)) InVars {~n~0=v_~n~0_22, ~i~0=v_~i~0_32} OutVars{~n~0=v_~n~0_22, ~i~0=v_~i~0_32, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 04:14:50,391 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:14:50,420 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:14:50,611 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [506] L71-->L74: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= (ite (and (<= 0 v_~i~0_32) (< v_~i~0_32 v_~n~0_22)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|)) InVars {~n~0=v_~n~0_22, ~i~0=v_~i~0_32} OutVars{~n~0=v_~n~0_22, ~i~0=v_~i~0_32, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 04:14:50,657 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:14:50,658 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 455 [2022-12-13 04:14:50,658 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 2381 transitions, 72698 flow [2022-12-13 04:14:50,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:50,658 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:14:50,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] [2022-12-13 04:14:50,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 04:14:50,658 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 1 more)] === [2022-12-13 04:14:50,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:14:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1877937017, now seen corresponding path program 8 times [2022-12-13 04:14:50,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:14:50,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856312783] [2022-12-13 04:14:50,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:14:50,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:14:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:14:51,328 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:14:51,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:14:51,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856312783] [2022-12-13 04:14:51,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856312783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:14:51,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:14:51,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:14:51,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033169809] [2022-12-13 04:14:51,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:14:51,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:14:51,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:14:51,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:14:51,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:14:51,329 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 04:14:51,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 2381 transitions, 72698 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:51,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:14:51,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 04:14:51,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:14:57,523 INFO L130 PetriNetUnfolder]: 7872/13980 cut-off events. [2022-12-13 04:14:57,523 INFO L131 PetriNetUnfolder]: For 3063/3063 co-relation queries the response was YES. [2022-12-13 04:14:57,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224524 conditions, 13980 events. 7872/13980 cut-off events. For 3063/3063 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 105768 event pairs, 370 based on Foata normal form. 8/13986 useless extension candidates. Maximal degree in co-relation 151415. Up to 13981 conditions per place. [2022-12-13 04:14:57,607 INFO L137 encePairwiseOnDemand]: 24/45 looper letters, 1867 selfloop transitions, 234 changer transitions 451/2552 dead transitions. [2022-12-13 04:14:57,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 2552 transitions, 83067 flow [2022-12-13 04:14:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:14:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:14:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2022-12-13 04:14:57,609 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42828282828282827 [2022-12-13 04:14:57,609 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 112 predicate places. [2022-12-13 04:14:57,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 2552 transitions, 83067 flow [2022-12-13 04:14:57,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 2101 transitions, 68343 flow [2022-12-13 04:14:57,768 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:14:57,768 INFO L89 Accepts]: Start accepts. Operand has 145 places, 2101 transitions, 68343 flow [2022-12-13 04:14:57,784 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:14:57,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:14:57,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 2101 transitions, 68343 flow [2022-12-13 04:14:57,820 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 2101 transitions, 68343 flow [2022-12-13 04:14:57,820 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:14:57,825 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:14:57,826 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 04:14:57,827 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 2101 transitions, 68343 flow [2022-12-13 04:14:57,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:57,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:14:57,828 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] [2022-12-13 04:14:57,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 04:14:57,828 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 1 more)] === [2022-12-13 04:14:57,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:14:57,828 INFO L85 PathProgramCache]: Analyzing trace with hash 796910679, now seen corresponding path program 1 times [2022-12-13 04:14:57,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:14:57,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302850118] [2022-12-13 04:14:57,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:14:57,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:14:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:14:57,893 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:14:57,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:14:57,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302850118] [2022-12-13 04:14:57,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302850118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:14:57,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:14:57,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:14:57,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535142663] [2022-12-13 04:14:57,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:14:57,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 04:14:57,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:14:57,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 04:14:57,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 04:14:57,895 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 42 [2022-12-13 04:14:57,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 2101 transitions, 68343 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:14:57,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:14:57,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 42 [2022-12-13 04:14:57,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:15:02,734 INFO L130 PetriNetUnfolder]: 6830/12154 cut-off events. [2022-12-13 04:15:02,747 INFO L131 PetriNetUnfolder]: For 4055/4055 co-relation queries the response was YES. [2022-12-13 04:15:02,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206821 conditions, 12154 events. 6830/12154 cut-off events. For 4055/4055 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 90005 event pairs, 374 based on Foata normal form. 36/12188 useless extension candidates. Maximal degree in co-relation 134024. Up to 12155 conditions per place. [2022-12-13 04:15:02,839 INFO L137 encePairwiseOnDemand]: 39/42 looper letters, 2071 selfloop transitions, 42 changer transitions 0/2130 dead transitions. [2022-12-13 04:15:02,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 2130 transitions, 73521 flow [2022-12-13 04:15:02,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 04:15:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 04:15:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 04:15:02,840 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2022-12-13 04:15:02,841 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 106 predicate places. [2022-12-13 04:15:02,841 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 2130 transitions, 73521 flow [2022-12-13 04:15:02,950 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 2130 transitions, 73521 flow [2022-12-13 04:15:03,032 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:15:03,033 INFO L89 Accepts]: Start accepts. Operand has 147 places, 2130 transitions, 73521 flow [2022-12-13 04:15:03,050 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:15:03,050 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:15:03,050 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 2130 transitions, 73521 flow [2022-12-13 04:15:03,090 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 2130 transitions, 73521 flow [2022-12-13 04:15:03,090 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:15:03,096 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:15:03,097 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-13 04:15:03,097 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 2130 transitions, 73521 flow [2022-12-13 04:15:03,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:03,097 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:15:03,097 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] [2022-12-13 04:15:03,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 04:15:03,097 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 1 more)] === [2022-12-13 04:15:03,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:15:03,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1784159259, now seen corresponding path program 1 times [2022-12-13 04:15:03,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:15:03,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112039257] [2022-12-13 04:15:03,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:15:03,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:15:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:15:03,191 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:15:03,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:15:03,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112039257] [2022-12-13 04:15:03,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112039257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:15:03,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:15:03,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:15:03,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562971960] [2022-12-13 04:15:03,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:15:03,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:15:03,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:15:03,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:15:03,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:15:03,193 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 42 [2022-12-13 04:15:03,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 2130 transitions, 73521 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:03,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:15:03,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 42 [2022-12-13 04:15:03,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:15:08,620 INFO L130 PetriNetUnfolder]: 7267/13108 cut-off events. [2022-12-13 04:15:08,621 INFO L131 PetriNetUnfolder]: For 6156/6156 co-relation queries the response was YES. [2022-12-13 04:15:08,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235687 conditions, 13108 events. 7267/13108 cut-off events. For 6156/6156 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 99707 event pairs, 350 based on Foata normal form. 65/13171 useless extension candidates. Maximal degree in co-relation 149772. Up to 13109 conditions per place. [2022-12-13 04:15:08,711 INFO L137 encePairwiseOnDemand]: 34/42 looper letters, 2209 selfloop transitions, 133 changer transitions 95/2454 dead transitions. [2022-12-13 04:15:08,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 2454 transitions, 89675 flow [2022-12-13 04:15:08,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:15:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:15:08,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-12-13 04:15:08,712 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3354978354978355 [2022-12-13 04:15:08,713 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 116 predicate places. [2022-12-13 04:15:08,713 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 2454 transitions, 89675 flow [2022-12-13 04:15:08,817 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 2359 transitions, 86207 flow [2022-12-13 04:15:08,910 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:15:08,910 INFO L89 Accepts]: Start accepts. Operand has 157 places, 2359 transitions, 86207 flow [2022-12-13 04:15:08,930 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:15:08,930 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:15:08,930 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 2359 transitions, 86207 flow [2022-12-13 04:15:08,973 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 2359 transitions, 86207 flow [2022-12-13 04:15:08,974 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:15:08,979 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:15:08,980 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 04:15:08,980 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 2359 transitions, 86207 flow [2022-12-13 04:15:08,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:08,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:15:08,980 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] [2022-12-13 04:15:08,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 04:15:08,980 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 1 more)] === [2022-12-13 04:15:08,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:15:08,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1697186133, now seen corresponding path program 2 times [2022-12-13 04:15:08,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:15:08,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942102921] [2022-12-13 04:15:08,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:15:08,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:15:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:15:09,079 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:15:09,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:15:09,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942102921] [2022-12-13 04:15:09,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942102921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:15:09,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:15:09,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:15:09,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480063525] [2022-12-13 04:15:09,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:15:09,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:15:09,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:15:09,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:15:09,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:15:09,080 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 42 [2022-12-13 04:15:09,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 2359 transitions, 86207 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:09,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:15:09,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 42 [2022-12-13 04:15:09,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:15:13,845 INFO L130 PetriNetUnfolder]: 5608/10165 cut-off events. [2022-12-13 04:15:13,845 INFO L131 PetriNetUnfolder]: For 7307/7307 co-relation queries the response was YES. [2022-12-13 04:15:13,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192506 conditions, 10165 events. 5608/10165 cut-off events. For 7307/7307 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 74359 event pairs, 338 based on Foata normal form. 77/10240 useless extension candidates. Maximal degree in co-relation 114882. Up to 10166 conditions per place. [2022-12-13 04:15:13,914 INFO L137 encePairwiseOnDemand]: 34/42 looper letters, 1642 selfloop transitions, 53 changer transitions 110/1822 dead transitions. [2022-12-13 04:15:13,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 1822 transitions, 70105 flow [2022-12-13 04:15:13,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:15:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:15:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2022-12-13 04:15:13,915 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.335978835978836 [2022-12-13 04:15:13,915 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 124 predicate places. [2022-12-13 04:15:13,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 1822 transitions, 70105 flow [2022-12-13 04:15:13,992 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 1712 transitions, 65871 flow [2022-12-13 04:15:14,055 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:15:14,056 INFO L89 Accepts]: Start accepts. Operand has 165 places, 1712 transitions, 65871 flow [2022-12-13 04:15:14,069 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:15:14,069 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:15:14,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 1712 transitions, 65871 flow [2022-12-13 04:15:14,098 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 1712 transitions, 65871 flow [2022-12-13 04:15:14,098 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:15:14,102 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:15:14,102 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 04:15:14,102 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 1712 transitions, 65871 flow [2022-12-13 04:15:14,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:14,102 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:15:14,102 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] [2022-12-13 04:15:14,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 04:15:14,103 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 1 more)] === [2022-12-13 04:15:14,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:15:14,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1514030805, now seen corresponding path program 1 times [2022-12-13 04:15:14,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:15:14,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784764927] [2022-12-13 04:15:14,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:15:14,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:15:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:15:14,198 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:15:14,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:15:14,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784764927] [2022-12-13 04:15:14,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784764927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:15:14,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:15:14,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:15:14,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238721090] [2022-12-13 04:15:14,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:15:14,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:15:14,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:15:14,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:15:14,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:15:14,199 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 40 [2022-12-13 04:15:14,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 1712 transitions, 65871 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:14,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:15:14,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 40 [2022-12-13 04:15:14,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:15:17,280 INFO L130 PetriNetUnfolder]: 4025/7294 cut-off events. [2022-12-13 04:15:17,280 INFO L131 PetriNetUnfolder]: For 8716/8716 co-relation queries the response was YES. [2022-12-13 04:15:17,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144816 conditions, 7294 events. 4025/7294 cut-off events. For 8716/8716 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 49782 event pairs, 298 based on Foata normal form. 65/7357 useless extension candidates. Maximal degree in co-relation 75331. Up to 7295 conditions per place. [2022-12-13 04:15:17,332 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 1036 selfloop transitions, 59 changer transitions 129/1241 dead transitions. [2022-12-13 04:15:17,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 1241 transitions, 50086 flow [2022-12-13 04:15:17,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:15:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:15:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions. [2022-12-13 04:15:17,333 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37222222222222223 [2022-12-13 04:15:17,333 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 132 predicate places. [2022-12-13 04:15:17,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 1241 transitions, 50086 flow [2022-12-13 04:15:17,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 1112 transitions, 44848 flow [2022-12-13 04:15:17,432 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:15:17,432 INFO L89 Accepts]: Start accepts. Operand has 173 places, 1112 transitions, 44848 flow [2022-12-13 04:15:17,442 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:15:17,442 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:15:17,442 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 1112 transitions, 44848 flow [2022-12-13 04:15:17,458 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 1112 transitions, 44848 flow [2022-12-13 04:15:17,458 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:15:17,461 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:15:17,462 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 04:15:17,462 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 1112 transitions, 44848 flow [2022-12-13 04:15:17,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:17,462 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:15:17,462 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] [2022-12-13 04:15:17,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 04:15:17,462 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 1 more)] === [2022-12-13 04:15:17,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:15:17,462 INFO L85 PathProgramCache]: Analyzing trace with hash -408805415, now seen corresponding path program 9 times [2022-12-13 04:15:17,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:15:17,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439740937] [2022-12-13 04:15:17,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:15:17,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:15:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:15:17,639 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:15:17,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:15:17,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439740937] [2022-12-13 04:15:17,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439740937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:15:17,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:15:17,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:15:17,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158988984] [2022-12-13 04:15:17,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:15:17,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:15:17,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:15:17,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:15:17,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:15:17,640 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:15:17,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 1112 transitions, 44848 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:17,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:15:17,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:15:17,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:15:20,504 INFO L130 PetriNetUnfolder]: 4471/8141 cut-off events. [2022-12-13 04:15:20,505 INFO L131 PetriNetUnfolder]: For 11006/11006 co-relation queries the response was YES. [2022-12-13 04:15:20,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169818 conditions, 8141 events. 4471/8141 cut-off events. For 11006/11006 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 56973 event pairs, 190 based on Foata normal form. 8/8147 useless extension candidates. Maximal degree in co-relation 79547. Up to 8142 conditions per place. [2022-12-13 04:15:20,570 INFO L137 encePairwiseOnDemand]: 25/38 looper letters, 1084 selfloop transitions, 131 changer transitions 380/1595 dead transitions. [2022-12-13 04:15:20,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 1595 transitions, 67589 flow [2022-12-13 04:15:20,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:15:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:15:20,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2022-12-13 04:15:20,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3763157894736842 [2022-12-13 04:15:20,571 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 141 predicate places. [2022-12-13 04:15:20,571 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 1595 transitions, 67589 flow [2022-12-13 04:15:20,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 1215 transitions, 51467 flow [2022-12-13 04:15:20,690 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:15:20,691 INFO L89 Accepts]: Start accepts. Operand has 180 places, 1215 transitions, 51467 flow [2022-12-13 04:15:20,702 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:15:20,702 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:15:20,702 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 1215 transitions, 51467 flow [2022-12-13 04:15:20,723 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 1215 transitions, 51467 flow [2022-12-13 04:15:20,724 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:15:20,728 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:15:20,730 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 04:15:20,730 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 1215 transitions, 51467 flow [2022-12-13 04:15:20,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:20,730 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:15:20,730 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] [2022-12-13 04:15:20,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 04:15:20,730 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 1 more)] === [2022-12-13 04:15:20,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:15:20,731 INFO L85 PathProgramCache]: Analyzing trace with hash -16917940, now seen corresponding path program 1 times [2022-12-13 04:15:20,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:15:20,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214038761] [2022-12-13 04:15:20,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:15:20,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:15:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:15:21,243 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:15:21,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:15:21,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214038761] [2022-12-13 04:15:21,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214038761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:15:21,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:15:21,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:15:21,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433128935] [2022-12-13 04:15:21,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:15:21,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:15:21,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:15:21,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:15:21,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:15:21,246 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:15:21,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 1215 transitions, 51467 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:21,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:15:21,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:15:21,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:15:24,132 INFO L130 PetriNetUnfolder]: 4159/7571 cut-off events. [2022-12-13 04:15:24,132 INFO L131 PetriNetUnfolder]: For 10337/10337 co-relation queries the response was YES. [2022-12-13 04:15:24,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165713 conditions, 7571 events. 4159/7571 cut-off events. For 10337/10337 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 52640 event pairs, 184 based on Foata normal form. 2/7571 useless extension candidates. Maximal degree in co-relation 74842. Up to 7572 conditions per place. [2022-12-13 04:15:24,196 INFO L137 encePairwiseOnDemand]: 26/38 looper letters, 1375 selfloop transitions, 111 changer transitions 85/1571 dead transitions. [2022-12-13 04:15:24,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 1571 transitions, 69666 flow [2022-12-13 04:15:24,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:15:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:15:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 201 transitions. [2022-12-13 04:15:24,197 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4407894736842105 [2022-12-13 04:15:24,198 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 150 predicate places. [2022-12-13 04:15:24,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 1571 transitions, 69666 flow [2022-12-13 04:15:24,271 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 1486 transitions, 65890 flow [2022-12-13 04:15:24,328 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:15:24,328 INFO L89 Accepts]: Start accepts. Operand has 189 places, 1486 transitions, 65890 flow [2022-12-13 04:15:24,344 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:15:24,344 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:15:24,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 1486 transitions, 65890 flow [2022-12-13 04:15:24,369 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 1486 transitions, 65890 flow [2022-12-13 04:15:24,369 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:15:24,374 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:15:24,374 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 04:15:24,374 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 1486 transitions, 65890 flow [2022-12-13 04:15:24,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:24,374 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:15:24,374 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] [2022-12-13 04:15:24,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 04:15:24,375 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 1 more)] === [2022-12-13 04:15:24,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:15:24,375 INFO L85 PathProgramCache]: Analyzing trace with hash -388705126, now seen corresponding path program 2 times [2022-12-13 04:15:24,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:15:24,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030405049] [2022-12-13 04:15:24,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:15:24,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:15:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:15:24,726 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:15:24,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:15:24,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030405049] [2022-12-13 04:15:24,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030405049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:15:24,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:15:24,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:15:24,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777031031] [2022-12-13 04:15:24,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:15:24,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:15:24,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:15:24,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:15:24,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:15:24,728 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:15:24,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 1486 transitions, 65890 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:24,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:15:24,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:15:24,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:15:27,694 INFO L130 PetriNetUnfolder]: 4108/7448 cut-off events. [2022-12-13 04:15:27,694 INFO L131 PetriNetUnfolder]: For 10364/10364 co-relation queries the response was YES. [2022-12-13 04:15:27,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170458 conditions, 7448 events. 4108/7448 cut-off events. For 10364/10364 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 51249 event pairs, 172 based on Foata normal form. 2/7448 useless extension candidates. Maximal degree in co-relation 77821. Up to 7449 conditions per place. [2022-12-13 04:15:27,758 INFO L137 encePairwiseOnDemand]: 26/38 looper letters, 1459 selfloop transitions, 94 changer transitions 48/1601 dead transitions. [2022-12-13 04:15:27,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 1601 transitions, 74185 flow [2022-12-13 04:15:27,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:15:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:15:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 185 transitions. [2022-12-13 04:15:27,759 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4057017543859649 [2022-12-13 04:15:27,759 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 159 predicate places. [2022-12-13 04:15:27,759 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 1601 transitions, 74185 flow [2022-12-13 04:15:27,831 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 1553 transitions, 71968 flow [2022-12-13 04:15:27,886 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:15:27,886 INFO L89 Accepts]: Start accepts. Operand has 198 places, 1553 transitions, 71968 flow [2022-12-13 04:15:27,903 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:15:27,903 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:15:27,903 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 1553 transitions, 71968 flow [2022-12-13 04:15:27,928 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 1553 transitions, 71968 flow [2022-12-13 04:15:27,929 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:15:27,932 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:15:27,933 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 04:15:27,933 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 1553 transitions, 71968 flow [2022-12-13 04:15:27,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:27,933 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:15:27,933 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] [2022-12-13 04:15:27,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 04:15:27,933 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 1 more)] === [2022-12-13 04:15:27,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:15:27,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2042604928, now seen corresponding path program 3 times [2022-12-13 04:15:27,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:15:27,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144082693] [2022-12-13 04:15:27,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:15:27,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:15:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:15:28,356 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:15:28,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:15:28,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144082693] [2022-12-13 04:15:28,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144082693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:15:28,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:15:28,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:15:28,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432451692] [2022-12-13 04:15:28,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:15:28,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:15:28,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:15:28,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:15:28,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:15:28,358 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:15:28,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 1553 transitions, 71968 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:28,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:15:28,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:15:28,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:15:31,854 INFO L130 PetriNetUnfolder]: 4349/7836 cut-off events. [2022-12-13 04:15:31,854 INFO L131 PetriNetUnfolder]: For 10317/10317 co-relation queries the response was YES. [2022-12-13 04:15:31,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187283 conditions, 7836 events. 4349/7836 cut-off events. For 10317/10317 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 54042 event pairs, 197 based on Foata normal form. 2/7836 useless extension candidates. Maximal degree in co-relation 87609. Up to 7837 conditions per place. [2022-12-13 04:15:31,926 INFO L137 encePairwiseOnDemand]: 25/38 looper letters, 1537 selfloop transitions, 122 changer transitions 45/1704 dead transitions. [2022-12-13 04:15:31,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 1704 transitions, 82400 flow [2022-12-13 04:15:31,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:15:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:15:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 193 transitions. [2022-12-13 04:15:31,927 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4232456140350877 [2022-12-13 04:15:31,927 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 168 predicate places. [2022-12-13 04:15:31,927 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 1704 transitions, 82400 flow [2022-12-13 04:15:32,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 208 places, 1659 transitions, 80192 flow [2022-12-13 04:15:32,230 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:15:32,230 INFO L89 Accepts]: Start accepts. Operand has 208 places, 1659 transitions, 80192 flow [2022-12-13 04:15:32,249 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:15:32,249 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:15:32,249 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 1659 transitions, 80192 flow [2022-12-13 04:15:32,284 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 1659 transitions, 80192 flow [2022-12-13 04:15:32,284 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:15:32,287 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:15:32,288 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 04:15:32,288 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 1659 transitions, 80192 flow [2022-12-13 04:15:32,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:32,288 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:15:32,288 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] [2022-12-13 04:15:32,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 04:15:32,289 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 1 more)] === [2022-12-13 04:15:32,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:15:32,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1744991500, now seen corresponding path program 4 times [2022-12-13 04:15:32,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:15:32,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613151610] [2022-12-13 04:15:32,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:15:32,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:15:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:15:32,819 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:15:32,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:15:32,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613151610] [2022-12-13 04:15:32,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613151610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:15:32,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:15:32,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:15:32,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942881177] [2022-12-13 04:15:32,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:15:32,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:15:32,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:15:32,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:15:32,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:15:32,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:15:32,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 1659 transitions, 80192 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:32,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:15:32,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:15:32,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:15:37,179 INFO L130 PetriNetUnfolder]: 4365/7904 cut-off events. [2022-12-13 04:15:37,179 INFO L131 PetriNetUnfolder]: For 10155/10155 co-relation queries the response was YES. [2022-12-13 04:15:37,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196750 conditions, 7904 events. 4365/7904 cut-off events. For 10155/10155 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 55015 event pairs, 193 based on Foata normal form. 2/7904 useless extension candidates. Maximal degree in co-relation 93100. Up to 7905 conditions per place. [2022-12-13 04:15:37,251 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 1546 selfloop transitions, 116 changer transitions 54/1716 dead transitions. [2022-12-13 04:15:37,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 1716 transitions, 86369 flow [2022-12-13 04:15:37,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:15:37,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:15:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 184 transitions. [2022-12-13 04:15:37,252 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44019138755980863 [2022-12-13 04:15:37,252 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 177 predicate places. [2022-12-13 04:15:37,252 INFO L82 GeneralOperation]: Start removeDead. Operand has 218 places, 1716 transitions, 86369 flow [2022-12-13 04:15:37,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 216 places, 1662 transitions, 83660 flow [2022-12-13 04:15:37,394 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:15:37,394 INFO L89 Accepts]: Start accepts. Operand has 216 places, 1662 transitions, 83660 flow [2022-12-13 04:15:37,414 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:15:37,414 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:15:37,414 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 1662 transitions, 83660 flow [2022-12-13 04:15:37,446 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 1662 transitions, 83660 flow [2022-12-13 04:15:37,447 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:15:37,450 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:15:37,451 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-13 04:15:37,451 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 1662 transitions, 83660 flow [2022-12-13 04:15:37,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:37,451 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:15:37,451 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] [2022-12-13 04:15:37,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 04:15:37,451 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 1 more)] === [2022-12-13 04:15:37,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:15:37,452 INFO L85 PathProgramCache]: Analyzing trace with hash 422770906, now seen corresponding path program 5 times [2022-12-13 04:15:37,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:15:37,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856503698] [2022-12-13 04:15:37,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:15:37,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:15:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:15:37,574 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:15:37,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:15:37,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856503698] [2022-12-13 04:15:37,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856503698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:15:37,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:15:37,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:15:37,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899977501] [2022-12-13 04:15:37,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:15:37,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:15:37,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:15:37,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:15:37,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:15:37,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:15:37,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 1662 transitions, 83660 flow. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:37,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:15:37,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:15:37,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:15:41,647 INFO L130 PetriNetUnfolder]: 4801/8686 cut-off events. [2022-12-13 04:15:41,647 INFO L131 PetriNetUnfolder]: For 12747/12747 co-relation queries the response was YES. [2022-12-13 04:15:41,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225139 conditions, 8686 events. 4801/8686 cut-off events. For 12747/12747 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 61547 event pairs, 203 based on Foata normal form. 4/8688 useless extension candidates. Maximal degree in co-relation 106117. Up to 8687 conditions per place. [2022-12-13 04:15:41,729 INFO L137 encePairwiseOnDemand]: 29/38 looper letters, 1713 selfloop transitions, 178 changer transitions 93/1984 dead transitions. [2022-12-13 04:15:41,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 1984 transitions, 103905 flow [2022-12-13 04:15:41,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:15:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:15:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2022-12-13 04:15:41,730 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39473684210526316 [2022-12-13 04:15:41,730 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 184 predicate places. [2022-12-13 04:15:41,730 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 1984 transitions, 103905 flow [2022-12-13 04:15:41,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 224 places, 1891 transitions, 99000 flow [2022-12-13 04:15:42,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:15:42,067 INFO L89 Accepts]: Start accepts. Operand has 224 places, 1891 transitions, 99000 flow [2022-12-13 04:15:42,087 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:15:42,087 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:15:42,088 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 1891 transitions, 99000 flow [2022-12-13 04:15:42,132 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 1891 transitions, 99000 flow [2022-12-13 04:15:42,132 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:15:42,135 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:15:42,136 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-13 04:15:42,136 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 1891 transitions, 99000 flow [2022-12-13 04:15:42,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:42,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:15:42,136 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] [2022-12-13 04:15:42,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 04:15:42,136 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 1 more)] === [2022-12-13 04:15:42,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:15:42,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1785917896, now seen corresponding path program 1 times [2022-12-13 04:15:42,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:15:42,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280934864] [2022-12-13 04:15:42,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:15:42,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:15:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:15:42,210 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:15:42,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:15:42,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280934864] [2022-12-13 04:15:42,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280934864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:15:42,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:15:42,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:15:42,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701529597] [2022-12-13 04:15:42,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:15:42,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:15:42,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:15:42,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:15:42,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:15:42,211 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-13 04:15:42,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 1891 transitions, 99000 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:42,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:15:42,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-13 04:15:42,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:15:45,138 INFO L130 PetriNetUnfolder]: 2462/4556 cut-off events. [2022-12-13 04:15:45,138 INFO L131 PetriNetUnfolder]: For 9304/9304 co-relation queries the response was YES. [2022-12-13 04:15:45,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122356 conditions, 4556 events. 2462/4556 cut-off events. For 9304/9304 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 29064 event pairs, 52 based on Foata normal form. 90/4644 useless extension candidates. Maximal degree in co-relation 76233. Up to 4557 conditions per place. [2022-12-13 04:15:45,178 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 930 selfloop transitions, 148 changer transitions 100/1193 dead transitions. [2022-12-13 04:15:45,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 1193 transitions, 64813 flow [2022-12-13 04:15:45,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:15:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:15:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2022-12-13 04:15:45,179 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2022-12-13 04:15:45,180 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 173 predicate places. [2022-12-13 04:15:45,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 214 places, 1193 transitions, 64813 flow [2022-12-13 04:15:45,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 1093 transitions, 59394 flow [2022-12-13 04:15:45,272 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:15:45,272 INFO L89 Accepts]: Start accepts. Operand has 207 places, 1093 transitions, 59394 flow [2022-12-13 04:15:45,286 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:15:45,286 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:15:45,286 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 1093 transitions, 59394 flow [2022-12-13 04:15:45,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 1093 transitions, 59394 flow [2022-12-13 04:15:45,310 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:15:45,345 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [505] L68-->L71: Formula: (= v_~i~0_24 (select (select |v_#memory_int_30| v_~f~0.base_19) (+ v_~f~0.offset_19 (* v_~i1~0_7 4)))) InVars {#memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, ~f~0.base=v_~f~0.base_19, ~f~0.offset=v_~f~0.offset_19} OutVars{~i~0=v_~i~0_24, ~f~0.base=v_~f~0.base_19, #memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~f~0.offset=v_~f~0.offset_19} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_#t~mem1#1] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 04:15:45,424 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:15:45,424 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-13 04:15:45,424 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 1091 transitions, 59302 flow [2022-12-13 04:15:45,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:45,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:15:45,425 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] [2022-12-13 04:15:45,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 04:15:45,425 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 1 more)] === [2022-12-13 04:15:45,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:15:45,425 INFO L85 PathProgramCache]: Analyzing trace with hash 363049124, now seen corresponding path program 6 times [2022-12-13 04:15:45,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:15:45,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968334595] [2022-12-13 04:15:45,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:15:45,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:15:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:15:46,329 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:15:46,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:15:46,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968334595] [2022-12-13 04:15:46,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968334595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:15:46,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:15:46,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:15:46,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688653018] [2022-12-13 04:15:46,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:15:46,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:15:46,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:15:46,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:15:46,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:15:46,331 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:15:46,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 1091 transitions, 59302 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:46,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:15:46,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:15:46,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:15:48,003 INFO L130 PetriNetUnfolder]: 2257/4137 cut-off events. [2022-12-13 04:15:48,003 INFO L131 PetriNetUnfolder]: For 7277/7277 co-relation queries the response was YES. [2022-12-13 04:15:48,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115347 conditions, 4137 events. 2257/4137 cut-off events. For 7277/7277 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 25468 event pairs, 52 based on Foata normal form. 2/4137 useless extension candidates. Maximal degree in co-relation 79074. Up to 4138 conditions per place. [2022-12-13 04:15:48,041 INFO L137 encePairwiseOnDemand]: 25/38 looper letters, 1022 selfloop transitions, 76 changer transitions 51/1149 dead transitions. [2022-12-13 04:15:48,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 1149 transitions, 64783 flow [2022-12-13 04:15:48,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:15:48,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:15:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-12-13 04:15:48,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3026315789473684 [2022-12-13 04:15:48,042 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 163 predicate places. [2022-12-13 04:15:48,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 1149 transitions, 64783 flow [2022-12-13 04:15:48,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 1098 transitions, 61923 flow [2022-12-13 04:15:48,125 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:15:48,126 INFO L89 Accepts]: Start accepts. Operand has 202 places, 1098 transitions, 61923 flow [2022-12-13 04:15:48,138 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:15:48,139 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:15:48,139 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 1098 transitions, 61923 flow [2022-12-13 04:15:48,159 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 1098 transitions, 61923 flow [2022-12-13 04:15:48,159 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:15:48,161 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:15:48,162 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 04:15:48,162 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 1098 transitions, 61923 flow [2022-12-13 04:15:48,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:48,162 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:15:48,162 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] [2022-12-13 04:15:48,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 04:15:48,162 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 1 more)] === [2022-12-13 04:15:48,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:15:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash -23089612, now seen corresponding path program 1 times [2022-12-13 04:15:48,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:15:48,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882559702] [2022-12-13 04:15:48,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:15:48,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:15:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:15:48,823 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:15:48,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:15:48,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882559702] [2022-12-13 04:15:48,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882559702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:15:48,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:15:48,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:15:48,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746149410] [2022-12-13 04:15:48,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:15:48,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:15:48,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:15:48,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:15:48,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:15:48,826 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:15:48,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 1098 transitions, 61923 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:15:48,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:15:48,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:15:48,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:15:50,731 INFO L130 PetriNetUnfolder]: 2266/4202 cut-off events. [2022-12-13 04:15:50,732 INFO L131 PetriNetUnfolder]: For 7751/7751 co-relation queries the response was YES. [2022-12-13 04:15:50,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121420 conditions, 4202 events. 2266/4202 cut-off events. For 7751/7751 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 26286 event pairs, 44 based on Foata normal form. 2/4202 useless extension candidates. Maximal degree in co-relation 81915. Up to 4203 conditions per place. [2022-12-13 04:15:50,773 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 1090 selfloop transitions, 70 changer transitions 26/1186 dead transitions. [2022-12-13 04:15:50,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 1186 transitions, 69313 flow [2022-12-13 04:15:50,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:15:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:15:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions. [2022-12-13 04:15:50,775 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 04:15:50,775 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 170 predicate places. [2022-12-13 04:15:50,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 211 places, 1186 transitions, 69313 flow [2022-12-13 04:15:50,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 1160 transitions, 67781 flow [2022-12-13 04:15:50,871 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:15:50,871 INFO L89 Accepts]: Start accepts. Operand has 210 places, 1160 transitions, 67781 flow [2022-12-13 04:15:50,888 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:15:50,888 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:15:50,888 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 1160 transitions, 67781 flow [2022-12-13 04:15:50,909 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 1160 transitions, 67781 flow [2022-12-13 04:15:50,910 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:15:50,912 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:15:50,913 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 04:15:50,913 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 1160 transitions, 67781 flow [2022-12-13 04:15:50,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:15:50,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:15:50,913 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] [2022-12-13 04:15:50,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 04:15:50,913 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 1 more)] === [2022-12-13 04:15:50,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:15:50,913 INFO L85 PathProgramCache]: Analyzing trace with hash 510799920, now seen corresponding path program 2 times [2022-12-13 04:15:50,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:15:50,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087888801] [2022-12-13 04:15:50,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:15:50,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:15:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:15:51,312 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:15:51,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:15:51,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087888801] [2022-12-13 04:15:51,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087888801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:15:51,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:15:51,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:15:51,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897892634] [2022-12-13 04:15:51,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:15:51,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:15:51,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:15:51,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:15:51,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:15:51,315 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:15:51,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 1160 transitions, 67781 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:15:51,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:15:51,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:15:51,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:15:53,335 INFO L130 PetriNetUnfolder]: 2252/4180 cut-off events. [2022-12-13 04:15:53,335 INFO L131 PetriNetUnfolder]: For 7523/7523 co-relation queries the response was YES. [2022-12-13 04:15:53,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124961 conditions, 4180 events. 2252/4180 cut-off events. For 7523/7523 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 26203 event pairs, 42 based on Foata normal form. 2/4180 useless extension candidates. Maximal degree in co-relation 84756. Up to 4181 conditions per place. [2022-12-13 04:15:53,374 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 1087 selfloop transitions, 57 changer transitions 72/1216 dead transitions. [2022-12-13 04:15:53,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 1216 transitions, 73515 flow [2022-12-13 04:15:53,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:15:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:15:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2022-12-13 04:15:53,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3736842105263158 [2022-12-13 04:15:53,375 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 178 predicate places. [2022-12-13 04:15:53,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 219 places, 1216 transitions, 73515 flow [2022-12-13 04:15:53,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 216 places, 1144 transitions, 69167 flow [2022-12-13 04:15:53,460 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:15:53,460 INFO L89 Accepts]: Start accepts. Operand has 216 places, 1144 transitions, 69167 flow [2022-12-13 04:15:53,475 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:15:53,475 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:15:53,475 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 1144 transitions, 69167 flow [2022-12-13 04:15:53,496 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 1144 transitions, 69167 flow [2022-12-13 04:15:53,496 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:15:53,498 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:15:53,499 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 04:15:53,499 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 1144 transitions, 69167 flow [2022-12-13 04:15:53,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:15:53,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:15:53,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] [2022-12-13 04:15:53,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 04:15:53,499 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 1 more)] === [2022-12-13 04:15:53,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:15:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash -38616168, now seen corresponding path program 3 times [2022-12-13 04:15:53,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:15:53,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786107876] [2022-12-13 04:15:53,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:15:53,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:15:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:15:53,920 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:15:53,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:15:53,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786107876] [2022-12-13 04:15:53,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786107876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:15:53,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:15:53,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:15:53,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133948719] [2022-12-13 04:15:53,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:15:53,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:15:53,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:15:53,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:15:53,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:15:53,921 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:15:53,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 1144 transitions, 69167 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:15:53,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:15:53,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:15:53,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:15:56,060 INFO L130 PetriNetUnfolder]: 2137/3973 cut-off events. [2022-12-13 04:15:56,060 INFO L131 PetriNetUnfolder]: For 7115/7115 co-relation queries the response was YES. [2022-12-13 04:15:56,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122760 conditions, 3973 events. 2137/3973 cut-off events. For 7115/7115 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 24633 event pairs, 46 based on Foata normal form. 2/3973 useless extension candidates. Maximal degree in co-relation 87597. Up to 3974 conditions per place. [2022-12-13 04:15:56,094 INFO L137 encePairwiseOnDemand]: 26/38 looper letters, 986 selfloop transitions, 62 changer transitions 94/1142 dead transitions. [2022-12-13 04:15:56,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 1142 transitions, 71331 flow [2022-12-13 04:15:56,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:15:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:15:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2022-12-13 04:15:56,095 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37105263157894736 [2022-12-13 04:15:56,095 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 184 predicate places. [2022-12-13 04:15:56,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 1142 transitions, 71331 flow [2022-12-13 04:15:56,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 1048 transitions, 65395 flow [2022-12-13 04:15:56,171 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:15:56,172 INFO L89 Accepts]: Start accepts. Operand has 223 places, 1048 transitions, 65395 flow [2022-12-13 04:15:56,183 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:15:56,184 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:15:56,184 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 1048 transitions, 65395 flow [2022-12-13 04:15:56,203 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 1048 transitions, 65395 flow [2022-12-13 04:15:56,203 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:15:56,225 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:15:56,226 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 04:15:56,226 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 1047 transitions, 65347 flow [2022-12-13 04:15:56,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:15:56,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:15:56,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] [2022-12-13 04:15:56,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 04:15:56,226 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 1 more)] === [2022-12-13 04:15:56,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:15:56,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1776595621, now seen corresponding path program 1 times [2022-12-13 04:15:56,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:15:56,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096327513] [2022-12-13 04:15:56,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:15:56,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:15:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:15:56,652 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:15:56,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:15:56,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096327513] [2022-12-13 04:15:56,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096327513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:15:56,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:15:56,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:15:56,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437817055] [2022-12-13 04:15:56,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:15:56,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:15:56,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:15:56,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:15:56,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:15:56,653 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 04:15:56,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 1047 transitions, 65347 flow. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:15:56,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:15:56,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 04:15:56,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:15:58,394 INFO L130 PetriNetUnfolder]: 2048/3824 cut-off events. [2022-12-13 04:15:58,394 INFO L131 PetriNetUnfolder]: For 6483/6483 co-relation queries the response was YES. [2022-12-13 04:15:58,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122005 conditions, 3824 events. 2048/3824 cut-off events. For 6483/6483 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23644 event pairs, 40 based on Foata normal form. 2/3824 useless extension candidates. Maximal degree in co-relation 90438. Up to 3825 conditions per place. [2022-12-13 04:15:58,431 INFO L137 encePairwiseOnDemand]: 27/40 looper letters, 986 selfloop transitions, 53 changer transitions 83/1122 dead transitions. [2022-12-13 04:15:58,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 1122 transitions, 72301 flow [2022-12-13 04:15:58,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:15:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:15:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2022-12-13 04:15:58,432 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 04:15:58,432 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 188 predicate places. [2022-12-13 04:15:58,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 1122 transitions, 72301 flow [2022-12-13 04:15:58,481 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 224 places, 1039 transitions, 66924 flow [2022-12-13 04:15:58,517 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:15:58,517 INFO L89 Accepts]: Start accepts. Operand has 224 places, 1039 transitions, 66924 flow [2022-12-13 04:15:58,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:15:58,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:15:58,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 1039 transitions, 66924 flow [2022-12-13 04:15:58,549 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 1039 transitions, 66924 flow [2022-12-13 04:15:58,550 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:15:58,552 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:15:58,553 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 04:15:58,553 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 1039 transitions, 66924 flow [2022-12-13 04:15:58,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:15:58,553 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:15:58,553 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] [2022-12-13 04:15:58,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 04:15:58,553 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 1 more)] === [2022-12-13 04:15:58,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:15:58,553 INFO L85 PathProgramCache]: Analyzing trace with hash 284667560, now seen corresponding path program 1 times [2022-12-13 04:15:58,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:15:58,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146905418] [2022-12-13 04:15:58,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:15:58,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:15:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:15:59,126 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:15:59,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:15:59,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146905418] [2022-12-13 04:15:59,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146905418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:15:59,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:15:59,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:15:59,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660316483] [2022-12-13 04:15:59,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:15:59,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:15:59,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:15:59,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:15:59,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:15:59,128 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:15:59,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 1039 transitions, 66924 flow. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:15:59,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:15:59,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:15:59,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:00,861 INFO L130 PetriNetUnfolder]: 1983/3667 cut-off events. [2022-12-13 04:16:00,861 INFO L131 PetriNetUnfolder]: For 6443/6443 co-relation queries the response was YES. [2022-12-13 04:16:00,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120612 conditions, 3667 events. 1983/3667 cut-off events. For 6443/6443 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 22181 event pairs, 42 based on Foata normal form. 2/3667 useless extension candidates. Maximal degree in co-relation 93279. Up to 3668 conditions per place. [2022-12-13 04:16:00,899 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 904 selfloop transitions, 50 changer transitions 83/1037 dead transitions. [2022-12-13 04:16:00,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 1037 transitions, 68870 flow [2022-12-13 04:16:00,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:16:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:16:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2022-12-13 04:16:00,900 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.391025641025641 [2022-12-13 04:16:00,900 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 190 predicate places. [2022-12-13 04:16:00,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 1037 transitions, 68870 flow [2022-12-13 04:16:00,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 954 transitions, 63332 flow [2022-12-13 04:16:00,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:00,984 INFO L89 Accepts]: Start accepts. Operand has 207 places, 954 transitions, 63332 flow [2022-12-13 04:16:00,999 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:00,999 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:00,999 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 954 transitions, 63332 flow [2022-12-13 04:16:01,021 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 954 transitions, 63332 flow [2022-12-13 04:16:01,021 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:04,034 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:16:04,035 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3051 [2022-12-13 04:16:04,035 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 953 transitions, 63266 flow [2022-12-13 04:16:04,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:16:04,035 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:04,035 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] [2022-12-13 04:16:04,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 04:16:04,036 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 1 more)] === [2022-12-13 04:16:04,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:04,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1553778266, now seen corresponding path program 1 times [2022-12-13 04:16:04,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:04,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12692700] [2022-12-13 04:16:04,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:04,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:04,601 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:16:04,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:04,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12692700] [2022-12-13 04:16:04,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12692700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:04,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:04,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:16:04,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388605041] [2022-12-13 04:16:04,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:04,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:16:04,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:04,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:16:04,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:16:04,602 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 04:16:04,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 953 transitions, 63266 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:04,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:04,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 04:16:04,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:06,158 INFO L130 PetriNetUnfolder]: 1923/3525 cut-off events. [2022-12-13 04:16:06,158 INFO L131 PetriNetUnfolder]: For 6405/6405 co-relation queries the response was YES. [2022-12-13 04:16:06,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119424 conditions, 3525 events. 1923/3525 cut-off events. For 6405/6405 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 20957 event pairs, 36 based on Foata normal form. 2/3525 useless extension candidates. Maximal degree in co-relation 96120. Up to 3526 conditions per place. [2022-12-13 04:16:06,201 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 893 selfloop transitions, 67 changer transitions 28/988 dead transitions. [2022-12-13 04:16:06,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 988 transitions, 67585 flow [2022-12-13 04:16:06,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:16:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:16:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2022-12-13 04:16:06,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3071253071253071 [2022-12-13 04:16:06,202 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 174 predicate places. [2022-12-13 04:16:06,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 215 places, 988 transitions, 67585 flow [2022-12-13 04:16:06,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 960 transitions, 65663 flow [2022-12-13 04:16:06,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:06,293 INFO L89 Accepts]: Start accepts. Operand has 213 places, 960 transitions, 65663 flow [2022-12-13 04:16:06,309 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:06,310 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:06,310 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 960 transitions, 65663 flow [2022-12-13 04:16:06,334 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 960 transitions, 65663 flow [2022-12-13 04:16:06,334 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:06,337 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:06,338 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 04:16:06,338 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 960 transitions, 65663 flow [2022-12-13 04:16:06,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:06,338 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:06,338 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] [2022-12-13 04:16:06,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 04:16:06,338 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 1 more)] === [2022-12-13 04:16:06,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:06,339 INFO L85 PathProgramCache]: Analyzing trace with hash 231448772, now seen corresponding path program 2 times [2022-12-13 04:16:06,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:06,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40358504] [2022-12-13 04:16:06,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:06,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:06,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:16:06,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:06,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40358504] [2022-12-13 04:16:06,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40358504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:06,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:06,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:16:06,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228155028] [2022-12-13 04:16:06,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:06,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:16:06,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:06,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:16:06,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:16:06,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 04:16:06,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 960 transitions, 65663 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:06,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:06,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 04:16:06,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:08,472 INFO L130 PetriNetUnfolder]: 1910/3474 cut-off events. [2022-12-13 04:16:08,473 INFO L131 PetriNetUnfolder]: For 6344/6344 co-relation queries the response was YES. [2022-12-13 04:16:08,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121159 conditions, 3474 events. 1910/3474 cut-off events. For 6344/6344 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 20462 event pairs, 36 based on Foata normal form. 2/3474 useless extension candidates. Maximal degree in co-relation 98961. Up to 3475 conditions per place. [2022-12-13 04:16:08,507 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 760 selfloop transitions, 44 changer transitions 154/958 dead transitions. [2022-12-13 04:16:08,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 958 transitions, 67443 flow [2022-12-13 04:16:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:16:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:16:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-12-13 04:16:08,508 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3614864864864865 [2022-12-13 04:16:08,508 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 179 predicate places. [2022-12-13 04:16:08,508 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 958 transitions, 67443 flow [2022-12-13 04:16:08,551 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 804 transitions, 56618 flow [2022-12-13 04:16:08,584 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:08,584 INFO L89 Accepts]: Start accepts. Operand has 158 places, 804 transitions, 56618 flow [2022-12-13 04:16:08,599 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:08,599 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:08,600 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 804 transitions, 56618 flow [2022-12-13 04:16:08,615 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 804 transitions, 56618 flow [2022-12-13 04:16:08,615 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:08,617 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:08,618 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 04:16:08,618 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 804 transitions, 56618 flow [2022-12-13 04:16:08,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:08,618 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:08,618 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] [2022-12-13 04:16:08,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 04:16:08,618 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 1 more)] === [2022-12-13 04:16:08,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:08,619 INFO L85 PathProgramCache]: Analyzing trace with hash -391340635, now seen corresponding path program 1 times [2022-12-13 04:16:08,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:08,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210827859] [2022-12-13 04:16:08,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:08,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:09,093 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:16:09,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:09,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210827859] [2022-12-13 04:16:09,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210827859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:09,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:09,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:16:09,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045653844] [2022-12-13 04:16:09,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:09,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:16:09,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:09,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:16:09,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:16:09,095 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:16:09,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 804 transitions, 56618 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:09,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:09,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:16:09,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:12,146 INFO L130 PetriNetUnfolder]: 3941/7098 cut-off events. [2022-12-13 04:16:12,146 INFO L131 PetriNetUnfolder]: For 13506/13506 co-relation queries the response was YES. [2022-12-13 04:16:12,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254656 conditions, 7098 events. 3941/7098 cut-off events. For 13506/13506 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 47872 event pairs, 90 based on Foata normal form. 4/7100 useless extension candidates. Maximal degree in co-relation 125265. Up to 7099 conditions per place. [2022-12-13 04:16:12,231 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 1605 selfloop transitions, 171 changer transitions 96/1872 dead transitions. [2022-12-13 04:16:12,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 1872 transitions, 135683 flow [2022-12-13 04:16:12,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:16:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:16:12,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2022-12-13 04:16:12,232 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-13 04:16:12,232 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 127 predicate places. [2022-12-13 04:16:12,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 1872 transitions, 135683 flow [2022-12-13 04:16:12,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 1776 transitions, 128663 flow [2022-12-13 04:16:12,414 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:12,415 INFO L89 Accepts]: Start accepts. Operand has 168 places, 1776 transitions, 128663 flow [2022-12-13 04:16:12,455 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:12,455 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:12,456 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 1776 transitions, 128663 flow [2022-12-13 04:16:12,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 1776 transitions, 128663 flow [2022-12-13 04:16:12,497 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:12,501 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:12,501 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-13 04:16:12,501 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 1776 transitions, 128663 flow [2022-12-13 04:16:12,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:12,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:12,501 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] [2022-12-13 04:16:12,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 04:16:12,501 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 1 more)] === [2022-12-13 04:16:12,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:12,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1998474469, now seen corresponding path program 2 times [2022-12-13 04:16:12,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:12,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166139366] [2022-12-13 04:16:12,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:12,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:13,265 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:16:13,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:13,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166139366] [2022-12-13 04:16:13,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166139366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:13,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:13,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:16:13,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356988183] [2022-12-13 04:16:13,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:13,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:16:13,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:13,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:16:13,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:16:13,266 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:16:13,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 1776 transitions, 128663 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:13,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:13,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:16:13,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:18,492 INFO L130 PetriNetUnfolder]: 3801/6966 cut-off events. [2022-12-13 04:16:18,492 INFO L131 PetriNetUnfolder]: For 13334/13334 co-relation queries the response was YES. [2022-12-13 04:16:18,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256835 conditions, 6966 events. 3801/6966 cut-off events. For 13334/13334 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 47877 event pairs, 116 based on Foata normal form. 4/6968 useless extension candidates. Maximal degree in co-relation 124433. Up to 6967 conditions per place. [2022-12-13 04:16:18,564 INFO L137 encePairwiseOnDemand]: 22/36 looper letters, 1545 selfloop transitions, 143 changer transitions 148/1836 dead transitions. [2022-12-13 04:16:18,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 1836 transitions, 136715 flow [2022-12-13 04:16:18,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:16:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:16:18,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 158 transitions. [2022-12-13 04:16:18,565 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.398989898989899 [2022-12-13 04:16:18,565 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 137 predicate places. [2022-12-13 04:16:18,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 1836 transitions, 136715 flow [2022-12-13 04:16:18,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 1688 transitions, 125577 flow [2022-12-13 04:16:18,733 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:18,733 INFO L89 Accepts]: Start accepts. Operand has 176 places, 1688 transitions, 125577 flow [2022-12-13 04:16:18,772 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:18,772 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:18,772 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 1688 transitions, 125577 flow [2022-12-13 04:16:18,817 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 1688 transitions, 125577 flow [2022-12-13 04:16:18,817 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:18,831 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:16:18,859 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:16:18,890 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:16:18,918 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:16:18,941 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:16:18,942 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-13 04:16:18,942 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 1687 transitions, 125525 flow [2022-12-13 04:16:18,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:18,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:18,942 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] [2022-12-13 04:16:18,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 04:16:18,942 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 1 more)] === [2022-12-13 04:16:18,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:18,942 INFO L85 PathProgramCache]: Analyzing trace with hash -891204245, now seen corresponding path program 3 times [2022-12-13 04:16:18,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:18,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528420404] [2022-12-13 04:16:18,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:18,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:19,438 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:16:19,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:19,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528420404] [2022-12-13 04:16:19,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528420404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:19,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:19,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:16:19,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79304035] [2022-12-13 04:16:19,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:19,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:16:19,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:19,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:16:19,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:16:19,440 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 04:16:19,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 1687 transitions, 125525 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:19,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:19,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 04:16:19,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:25,032 INFO L130 PetriNetUnfolder]: 3800/7035 cut-off events. [2022-12-13 04:16:25,032 INFO L131 PetriNetUnfolder]: For 11871/11871 co-relation queries the response was YES. [2022-12-13 04:16:25,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266382 conditions, 7035 events. 3800/7035 cut-off events. For 11871/11871 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 49370 event pairs, 86 based on Foata normal form. 4/7037 useless extension candidates. Maximal degree in co-relation 130389. Up to 7036 conditions per place. [2022-12-13 04:16:25,105 INFO L137 encePairwiseOnDemand]: 25/44 looper letters, 1522 selfloop transitions, 129 changer transitions 215/1866 dead transitions. [2022-12-13 04:16:25,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 1866 transitions, 142573 flow [2022-12-13 04:16:25,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:16:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:16:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 172 transitions. [2022-12-13 04:16:25,106 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32575757575757575 [2022-12-13 04:16:25,107 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 144 predicate places. [2022-12-13 04:16:25,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 1866 transitions, 142573 flow [2022-12-13 04:16:25,209 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 1651 transitions, 126136 flow [2022-12-13 04:16:25,282 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:25,283 INFO L89 Accepts]: Start accepts. Operand has 180 places, 1651 transitions, 126136 flow [2022-12-13 04:16:25,320 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:25,320 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:25,320 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 1651 transitions, 126136 flow [2022-12-13 04:16:25,362 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 1651 transitions, 126136 flow [2022-12-13 04:16:25,362 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:25,365 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:25,366 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-13 04:16:25,366 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 1651 transitions, 126136 flow [2022-12-13 04:16:25,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:25,366 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:25,366 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] [2022-12-13 04:16:25,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 04:16:25,366 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 1 more)] === [2022-12-13 04:16:25,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:25,366 INFO L85 PathProgramCache]: Analyzing trace with hash -376975873, now seen corresponding path program 1 times [2022-12-13 04:16:25,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:25,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541631799] [2022-12-13 04:16:25,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:25,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:25,866 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:16:25,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:25,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541631799] [2022-12-13 04:16:25,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541631799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:25,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:25,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:16:25,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058636240] [2022-12-13 04:16:25,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:25,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:16:25,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:25,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:16:25,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:16:25,867 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 04:16:25,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 1651 transitions, 126136 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:25,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:25,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 04:16:25,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:30,636 INFO L130 PetriNetUnfolder]: 3655/6790 cut-off events. [2022-12-13 04:16:30,636 INFO L131 PetriNetUnfolder]: For 10690/10690 co-relation queries the response was YES. [2022-12-13 04:16:30,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263966 conditions, 6790 events. 3655/6790 cut-off events. For 10690/10690 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 47528 event pairs, 66 based on Foata normal form. 4/6792 useless extension candidates. Maximal degree in co-relation 123754. Up to 6791 conditions per place. [2022-12-13 04:16:30,825 INFO L137 encePairwiseOnDemand]: 27/44 looper letters, 1530 selfloop transitions, 128 changer transitions 120/1778 dead transitions. [2022-12-13 04:16:30,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1778 transitions, 139479 flow [2022-12-13 04:16:30,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:16:30,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:16:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2022-12-13 04:16:30,827 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2022-12-13 04:16:30,827 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 148 predicate places. [2022-12-13 04:16:30,827 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 1778 transitions, 139479 flow [2022-12-13 04:16:30,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 1658 transitions, 130011 flow [2022-12-13 04:16:30,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:30,995 INFO L89 Accepts]: Start accepts. Operand has 186 places, 1658 transitions, 130011 flow [2022-12-13 04:16:31,040 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:31,040 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:31,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 1658 transitions, 130011 flow [2022-12-13 04:16:31,083 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 1658 transitions, 130011 flow [2022-12-13 04:16:31,083 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:31,086 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:31,087 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 04:16:31,087 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 1658 transitions, 130011 flow [2022-12-13 04:16:31,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:31,087 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:31,087 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] [2022-12-13 04:16:31,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 04:16:31,088 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 1 more)] === [2022-12-13 04:16:31,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:31,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1138632819, now seen corresponding path program 1 times [2022-12-13 04:16:31,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:31,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492714457] [2022-12-13 04:16:31,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:31,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:31,620 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:16:31,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:31,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492714457] [2022-12-13 04:16:31,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492714457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:31,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:31,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:16:31,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254449537] [2022-12-13 04:16:31,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:31,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:16:31,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:31,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:16:31,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:16:31,622 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 04:16:31,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 1658 transitions, 130011 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:31,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:31,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 04:16:31,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:36,593 INFO L130 PetriNetUnfolder]: 3601/6654 cut-off events. [2022-12-13 04:16:36,593 INFO L131 PetriNetUnfolder]: For 10669/10669 co-relation queries the response was YES. [2022-12-13 04:16:36,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265297 conditions, 6654 events. 3601/6654 cut-off events. For 10669/10669 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 46015 event pairs, 86 based on Foata normal form. 4/6656 useless extension candidates. Maximal degree in co-relation 119062. Up to 6655 conditions per place. [2022-12-13 04:16:36,688 INFO L137 encePairwiseOnDemand]: 22/40 looper letters, 1517 selfloop transitions, 125 changer transitions 108/1750 dead transitions. [2022-12-13 04:16:36,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1750 transitions, 140789 flow [2022-12-13 04:16:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:16:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:16:36,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2022-12-13 04:16:36,689 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2022-12-13 04:16:36,689 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 155 predicate places. [2022-12-13 04:16:36,689 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 1750 transitions, 140789 flow [2022-12-13 04:16:36,908 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 1642 transitions, 132041 flow [2022-12-13 04:16:36,988 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:36,989 INFO L89 Accepts]: Start accepts. Operand has 195 places, 1642 transitions, 132041 flow [2022-12-13 04:16:37,034 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:37,035 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:37,035 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 1642 transitions, 132041 flow [2022-12-13 04:16:37,078 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 1642 transitions, 132041 flow [2022-12-13 04:16:37,078 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:37,081 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:37,082 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 04:16:37,082 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 1642 transitions, 132041 flow [2022-12-13 04:16:37,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:37,082 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:37,082 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] [2022-12-13 04:16:37,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 04:16:37,082 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 1 more)] === [2022-12-13 04:16:37,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:37,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1072379101, now seen corresponding path program 2 times [2022-12-13 04:16:37,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:37,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426591548] [2022-12-13 04:16:37,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:37,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:37,590 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:16:37,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:37,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426591548] [2022-12-13 04:16:37,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426591548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:37,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:37,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:16:37,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370608473] [2022-12-13 04:16:37,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:37,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:16:37,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:37,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:16:37,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:16:37,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 04:16:37,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 1642 transitions, 132041 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:37,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:37,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 04:16:37,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:42,667 INFO L130 PetriNetUnfolder]: 3461/6398 cut-off events. [2022-12-13 04:16:42,667 INFO L131 PetriNetUnfolder]: For 10624/10624 co-relation queries the response was YES. [2022-12-13 04:16:42,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261404 conditions, 6398 events. 3461/6398 cut-off events. For 10624/10624 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 43783 event pairs, 82 based on Foata normal form. 4/6400 useless extension candidates. Maximal degree in co-relation 116007. Up to 6399 conditions per place. [2022-12-13 04:16:42,741 INFO L137 encePairwiseOnDemand]: 23/40 looper letters, 1320 selfloop transitions, 122 changer transitions 303/1745 dead transitions. [2022-12-13 04:16:42,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 1745 transitions, 143824 flow [2022-12-13 04:16:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:16:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:16:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 169 transitions. [2022-12-13 04:16:42,742 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35208333333333336 [2022-12-13 04:16:42,742 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 165 predicate places. [2022-12-13 04:16:42,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 206 places, 1745 transitions, 143824 flow [2022-12-13 04:16:42,831 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 1442 transitions, 118786 flow [2022-12-13 04:16:42,943 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:42,944 INFO L89 Accepts]: Start accepts. Operand has 202 places, 1442 transitions, 118786 flow [2022-12-13 04:16:42,976 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:42,976 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:42,976 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 1442 transitions, 118786 flow [2022-12-13 04:16:43,010 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 1442 transitions, 118786 flow [2022-12-13 04:16:43,011 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:43,015 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [505] L68-->L71: Formula: (= v_~i~0_24 (select (select |v_#memory_int_30| v_~f~0.base_19) (+ v_~f~0.offset_19 (* v_~i1~0_7 4)))) InVars {#memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, ~f~0.base=v_~f~0.base_19, ~f~0.offset=v_~f~0.offset_19} OutVars{~i~0=v_~i~0_24, ~f~0.base=v_~f~0.base_19, #memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~f~0.offset=v_~f~0.offset_19} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_#t~mem1#1] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 04:16:43,123 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:16:43,123 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-13 04:16:43,123 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 1440 transitions, 118638 flow [2022-12-13 04:16:43,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:43,124 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:43,124 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] [2022-12-13 04:16:43,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 04:16:43,124 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 1 more)] === [2022-12-13 04:16:43,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:43,124 INFO L85 PathProgramCache]: Analyzing trace with hash -425890203, now seen corresponding path program 4 times [2022-12-13 04:16:43,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:43,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493953571] [2022-12-13 04:16:43,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:43,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:43,543 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:16:43,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:43,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493953571] [2022-12-13 04:16:43,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493953571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:43,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:43,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:16:43,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189101818] [2022-12-13 04:16:43,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:43,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:16:43,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:43,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:16:43,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:16:43,545 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:16:43,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 1440 transitions, 118638 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:43,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:43,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:16:43,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:47,298 INFO L130 PetriNetUnfolder]: 3072/5600 cut-off events. [2022-12-13 04:16:47,298 INFO L131 PetriNetUnfolder]: For 9907/9907 co-relation queries the response was YES. [2022-12-13 04:16:47,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234532 conditions, 5600 events. 3072/5600 cut-off events. For 9907/9907 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 36559 event pairs, 58 based on Foata normal form. 4/5602 useless extension candidates. Maximal degree in co-relation 118848. Up to 5601 conditions per place. [2022-12-13 04:16:47,360 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 1167 selfloop transitions, 63 changer transitions 318/1548 dead transitions. [2022-12-13 04:16:47,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1548 transitions, 130630 flow [2022-12-13 04:16:47,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:16:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:16:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 154 transitions. [2022-12-13 04:16:47,361 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2022-12-13 04:16:47,361 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 162 predicate places. [2022-12-13 04:16:47,361 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 1548 transitions, 130630 flow [2022-12-13 04:16:47,532 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 1230 transitions, 103814 flow [2022-12-13 04:16:47,591 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:47,591 INFO L89 Accepts]: Start accepts. Operand has 198 places, 1230 transitions, 103814 flow [2022-12-13 04:16:47,626 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:47,626 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:47,626 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 1230 transitions, 103814 flow [2022-12-13 04:16:47,656 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 1230 transitions, 103814 flow [2022-12-13 04:16:47,656 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:47,658 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:47,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-13 04:16:47,659 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 1230 transitions, 103814 flow [2022-12-13 04:16:47,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:47,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:47,659 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] [2022-12-13 04:16:47,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 04:16:47,659 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 1 more)] === [2022-12-13 04:16:47,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:47,659 INFO L85 PathProgramCache]: Analyzing trace with hash -351693971, now seen corresponding path program 1 times [2022-12-13 04:16:47,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:47,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485855551] [2022-12-13 04:16:47,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:47,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:48,124 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:16:48,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:48,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485855551] [2022-12-13 04:16:48,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485855551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:48,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:48,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:16:48,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453487718] [2022-12-13 04:16:48,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:48,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:16:48,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:48,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:16:48,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:16:48,125 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:16:48,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 1230 transitions, 103814 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:48,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:48,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:16:48,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:51,159 INFO L130 PetriNetUnfolder]: 2599/4761 cut-off events. [2022-12-13 04:16:51,159 INFO L131 PetriNetUnfolder]: For 9226/9226 co-relation queries the response was YES. [2022-12-13 04:16:51,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204215 conditions, 4761 events. 2599/4761 cut-off events. For 9226/9226 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 30091 event pairs, 36 based on Foata normal form. 2/4761 useless extension candidates. Maximal degree in co-relation 121689. Up to 4762 conditions per place. [2022-12-13 04:16:51,217 INFO L137 encePairwiseOnDemand]: 26/38 looper letters, 1224 selfloop transitions, 84 changer transitions 26/1334 dead transitions. [2022-12-13 04:16:51,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 1334 transitions, 115320 flow [2022-12-13 04:16:51,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:16:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:16:51,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2022-12-13 04:16:51,218 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3923444976076555 [2022-12-13 04:16:51,218 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 167 predicate places. [2022-12-13 04:16:51,218 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 1334 transitions, 115320 flow [2022-12-13 04:16:51,296 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 1308 transitions, 113060 flow [2022-12-13 04:16:51,348 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:51,348 INFO L89 Accepts]: Start accepts. Operand has 207 places, 1308 transitions, 113060 flow [2022-12-13 04:16:51,385 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:51,385 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:51,385 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 1308 transitions, 113060 flow [2022-12-13 04:16:51,418 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 1308 transitions, 113060 flow [2022-12-13 04:16:51,418 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:51,421 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:51,421 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-13 04:16:51,421 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 1308 transitions, 113060 flow [2022-12-13 04:16:51,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:51,421 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:51,421 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] [2022-12-13 04:16:51,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 04:16:51,421 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 1 more)] === [2022-12-13 04:16:51,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:51,422 INFO L85 PathProgramCache]: Analyzing trace with hash -676937272, now seen corresponding path program 1 times [2022-12-13 04:16:51,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:51,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72817282] [2022-12-13 04:16:51,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:51,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:51,911 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:16:51,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:51,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72817282] [2022-12-13 04:16:51,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72817282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:51,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:51,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:16:51,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313269497] [2022-12-13 04:16:51,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:51,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:16:51,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:51,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:16:51,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:16:51,915 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:16:51,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 1308 transitions, 113060 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:51,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:51,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:16:51,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:55,155 INFO L130 PetriNetUnfolder]: 2752/5042 cut-off events. [2022-12-13 04:16:55,155 INFO L131 PetriNetUnfolder]: For 10003/10003 co-relation queries the response was YES. [2022-12-13 04:16:55,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221255 conditions, 5042 events. 2752/5042 cut-off events. For 10003/10003 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 32476 event pairs, 36 based on Foata normal form. 2/5042 useless extension candidates. Maximal degree in co-relation 124530. Up to 5043 conditions per place. [2022-12-13 04:16:55,214 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 1303 selfloop transitions, 62 changer transitions 66/1431 dead transitions. [2022-12-13 04:16:55,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 1431 transitions, 126565 flow [2022-12-13 04:16:55,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:16:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:16:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2022-12-13 04:16:55,215 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41812865497076024 [2022-12-13 04:16:55,216 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 174 predicate places. [2022-12-13 04:16:55,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 215 places, 1431 transitions, 126565 flow [2022-12-13 04:16:55,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 212 places, 1365 transitions, 120729 flow [2022-12-13 04:16:55,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:55,351 INFO L89 Accepts]: Start accepts. Operand has 212 places, 1365 transitions, 120729 flow [2022-12-13 04:16:55,390 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:55,391 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:55,391 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 1365 transitions, 120729 flow [2022-12-13 04:16:55,425 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 212 places, 1365 transitions, 120729 flow [2022-12-13 04:16:55,425 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:55,427 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:55,427 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-13 04:16:55,427 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 1365 transitions, 120729 flow [2022-12-13 04:16:55,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:55,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:55,428 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] [2022-12-13 04:16:55,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 04:16:55,428 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:16:55,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:55,428 INFO L85 PathProgramCache]: Analyzing trace with hash -497438824, now seen corresponding path program 2 times [2022-12-13 04:16:55,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:55,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124132837] [2022-12-13 04:16:55,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:55,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:55,906 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:16:55,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:55,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124132837] [2022-12-13 04:16:55,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124132837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:55,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:55,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:16:55,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133251906] [2022-12-13 04:16:55,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:55,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:16:55,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:55,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:16:55,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:16:55,907 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:16:55,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 1365 transitions, 120729 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:55,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:55,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:16:55,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:59,510 INFO L130 PetriNetUnfolder]: 2763/5105 cut-off events. [2022-12-13 04:16:59,511 INFO L131 PetriNetUnfolder]: For 9684/9684 co-relation queries the response was YES. [2022-12-13 04:16:59,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229228 conditions, 5105 events. 2763/5105 cut-off events. For 9684/9684 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 33254 event pairs, 38 based on Foata normal form. 4/5107 useless extension candidates. Maximal degree in co-relation 127371. Up to 5106 conditions per place. [2022-12-13 04:16:59,664 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 1245 selfloop transitions, 59 changer transitions 165/1469 dead transitions. [2022-12-13 04:16:59,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 1469 transitions, 132927 flow [2022-12-13 04:16:59,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:16:59,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:16:59,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2022-12-13 04:16:59,665 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2022-12-13 04:16:59,665 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 179 predicate places. [2022-12-13 04:16:59,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 1469 transitions, 132927 flow [2022-12-13 04:16:59,748 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 1304 transitions, 117932 flow [2022-12-13 04:16:59,805 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:59,805 INFO L89 Accepts]: Start accepts. Operand has 209 places, 1304 transitions, 117932 flow [2022-12-13 04:16:59,844 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:59,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:59,844 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 1304 transitions, 117932 flow [2022-12-13 04:16:59,880 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 1304 transitions, 117932 flow [2022-12-13 04:16:59,881 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:59,883 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:59,884 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-13 04:16:59,884 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 1304 transitions, 117932 flow [2022-12-13 04:16:59,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:59,884 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:59,884 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] [2022-12-13 04:16:59,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 04:16:59,884 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:16:59,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:59,884 INFO L85 PathProgramCache]: Analyzing trace with hash -336932135, now seen corresponding path program 2 times [2022-12-13 04:16:59,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:59,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347775667] [2022-12-13 04:16:59,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:59,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:00,935 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:17:00,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:17:00,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347775667] [2022-12-13 04:17:00,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347775667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:17:00,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:17:00,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:17:00,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492011528] [2022-12-13 04:17:00,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:17:00,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:17:00,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:17:00,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:17:00,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:17:00,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 04:17:00,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 1304 transitions, 117932 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:17:00,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:17:00,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 04:17:00,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:17:04,211 INFO L130 PetriNetUnfolder]: 2583/4725 cut-off events. [2022-12-13 04:17:04,211 INFO L131 PetriNetUnfolder]: For 9004/9004 co-relation queries the response was YES. [2022-12-13 04:17:04,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216843 conditions, 4725 events. 2583/4725 cut-off events. For 9004/9004 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 29860 event pairs, 36 based on Foata normal form. 2/4725 useless extension candidates. Maximal degree in co-relation 130212. Up to 4726 conditions per place. [2022-12-13 04:17:04,267 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 1208 selfloop transitions, 64 changer transitions 72/1344 dead transitions. [2022-12-13 04:17:04,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 1344 transitions, 124262 flow [2022-12-13 04:17:04,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:17:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:17:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2022-12-13 04:17:04,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40540540540540543 [2022-12-13 04:17:04,269 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 177 predicate places. [2022-12-13 04:17:04,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 218 places, 1344 transitions, 124262 flow [2022-12-13 04:17:04,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 215 places, 1272 transitions, 117610 flow [2022-12-13 04:17:04,402 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:17:04,402 INFO L89 Accepts]: Start accepts. Operand has 215 places, 1272 transitions, 117610 flow [2022-12-13 04:17:04,438 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:17:04,438 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:17:04,438 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 1272 transitions, 117610 flow [2022-12-13 04:17:04,472 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 1272 transitions, 117610 flow [2022-12-13 04:17:04,472 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:17:04,475 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:17:04,475 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-13 04:17:04,475 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 1272 transitions, 117610 flow [2022-12-13 04:17:04,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:17:04,475 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:17:04,475 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] [2022-12-13 04:17:04,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 04:17:04,476 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:17:04,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:17:04,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1955003129, now seen corresponding path program 3 times [2022-12-13 04:17:04,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:17:04,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741911127] [2022-12-13 04:17:04,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:17:04,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:17:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:05,021 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:17:05,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:17:05,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741911127] [2022-12-13 04:17:05,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741911127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:17:05,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:17:05,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:17:05,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215656927] [2022-12-13 04:17:05,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:17:05,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:17:05,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:17:05,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:17:05,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:17:05,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 04:17:05,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 1272 transitions, 117610 flow. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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:17:05,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:17:05,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 04:17:05,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:17:08,061 INFO L130 PetriNetUnfolder]: 2467/4523 cut-off events. [2022-12-13 04:17:08,061 INFO L131 PetriNetUnfolder]: For 8588/8588 co-relation queries the response was YES. [2022-12-13 04:17:08,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212113 conditions, 4523 events. 2467/4523 cut-off events. For 8588/8588 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 28313 event pairs, 36 based on Foata normal form. 4/4525 useless extension candidates. Maximal degree in co-relation 133053. Up to 4524 conditions per place. [2022-12-13 04:17:08,238 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 1035 selfloop transitions, 58 changer transitions 182/1275 dead transitions. [2022-12-13 04:17:08,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 1275 transitions, 120445 flow [2022-12-13 04:17:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:17:08,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:17:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2022-12-13 04:17:08,239 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4027027027027027 [2022-12-13 04:17:08,239 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 183 predicate places. [2022-12-13 04:17:08,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 224 places, 1275 transitions, 120445 flow [2022-12-13 04:17:08,309 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 1093 transitions, 103178 flow [2022-12-13 04:17:08,360 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:17:08,361 INFO L89 Accepts]: Start accepts. Operand has 207 places, 1093 transitions, 103178 flow [2022-12-13 04:17:08,386 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:17:08,386 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:17:08,387 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 1093 transitions, 103178 flow [2022-12-13 04:17:08,416 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 1093 transitions, 103178 flow [2022-12-13 04:17:08,416 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:17:08,418 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:17:08,419 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-13 04:17:08,419 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 1093 transitions, 103178 flow [2022-12-13 04:17:08,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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:17:08,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:17:08,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] [2022-12-13 04:17:08,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 04:17:08,419 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:17:08,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:17:08,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1649871590, now seen corresponding path program 1 times [2022-12-13 04:17:08,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:17:08,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414679155] [2022-12-13 04:17:08,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:17:08,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:17:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:08,865 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:17:08,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:17:08,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414679155] [2022-12-13 04:17:08,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414679155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:17:08,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:17:08,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:17:08,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999640146] [2022-12-13 04:17:08,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:17:08,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:17:08,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:17:08,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:17:08,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:17:08,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:17:08,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 1093 transitions, 103178 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:08,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:17:08,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:17:08,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:17:11,723 INFO L130 PetriNetUnfolder]: 2253/4048 cut-off events. [2022-12-13 04:17:11,723 INFO L131 PetriNetUnfolder]: For 7873/7873 co-relation queries the response was YES. [2022-12-13 04:17:11,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193805 conditions, 4048 events. 2253/4048 cut-off events. For 7873/7873 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 24242 event pairs, 36 based on Foata normal form. 2/4048 useless extension candidates. Maximal degree in co-relation 135894. Up to 4049 conditions per place. [2022-12-13 04:17:11,778 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 964 selfloop transitions, 85 changer transitions 42/1091 dead transitions. [2022-12-13 04:17:11,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 1091 transitions, 105172 flow [2022-12-13 04:17:11,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:17:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:17:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2022-12-13 04:17:11,779 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3972222222222222 [2022-12-13 04:17:11,779 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 175 predicate places. [2022-12-13 04:17:11,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 1091 transitions, 105172 flow [2022-12-13 04:17:11,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 215 places, 1049 transitions, 101092 flow [2022-12-13 04:17:11,901 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:17:11,902 INFO L89 Accepts]: Start accepts. Operand has 215 places, 1049 transitions, 101092 flow [2022-12-13 04:17:11,926 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:17:11,927 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:17:11,927 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 1049 transitions, 101092 flow [2022-12-13 04:17:11,955 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 1049 transitions, 101092 flow [2022-12-13 04:17:11,955 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:17:11,957 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:17:11,957 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 04:17:11,957 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 1049 transitions, 101092 flow [2022-12-13 04:17:11,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:11,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:17:11,958 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] [2022-12-13 04:17:11,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 04:17:11,958 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:17:11,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:17:11,958 INFO L85 PathProgramCache]: Analyzing trace with hash 961331044, now seen corresponding path program 2 times [2022-12-13 04:17:11,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:17:11,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499810507] [2022-12-13 04:17:11,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:17:11,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:17:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:12,612 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:17:12,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:17:12,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499810507] [2022-12-13 04:17:12,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499810507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:17:12,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:17:12,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:17:12,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338950219] [2022-12-13 04:17:12,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:17:12,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:17:12,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:17:12,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:17:12,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:17:12,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:17:12,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 1049 transitions, 101092 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:12,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:17:12,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:17:12,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:17:15,104 INFO L130 PetriNetUnfolder]: 2247/4070 cut-off events. [2022-12-13 04:17:15,104 INFO L131 PetriNetUnfolder]: For 7860/7860 co-relation queries the response was YES. [2022-12-13 04:17:15,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198898 conditions, 4070 events. 2247/4070 cut-off events. For 7860/7860 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 24683 event pairs, 40 based on Foata normal form. 2/4070 useless extension candidates. Maximal degree in co-relation 138735. Up to 4071 conditions per place. [2022-12-13 04:17:15,161 INFO L137 encePairwiseOnDemand]: 24/36 looper letters, 950 selfloop transitions, 81 changer transitions 80/1111 dead transitions. [2022-12-13 04:17:15,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 1111 transitions, 109279 flow [2022-12-13 04:17:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:17:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:17:15,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 151 transitions. [2022-12-13 04:17:15,162 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34953703703703703 [2022-12-13 04:17:15,163 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 185 predicate places. [2022-12-13 04:17:15,163 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 1111 transitions, 109279 flow [2022-12-13 04:17:15,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 1031 transitions, 101402 flow [2022-12-13 04:17:15,419 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:17:15,420 INFO L89 Accepts]: Start accepts. Operand has 223 places, 1031 transitions, 101402 flow [2022-12-13 04:17:15,444 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:17:15,444 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:17:15,444 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 1031 transitions, 101402 flow [2022-12-13 04:17:15,472 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 1031 transitions, 101402 flow [2022-12-13 04:17:15,472 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:17:15,474 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:17:15,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 04:17:15,474 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 1031 transitions, 101402 flow [2022-12-13 04:17:15,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:15,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:17:15,474 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] [2022-12-13 04:17:15,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 04:17:15,475 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:17:15,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:17:15,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2073748750, now seen corresponding path program 3 times [2022-12-13 04:17:15,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:17:15,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938917065] [2022-12-13 04:17:15,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:17:15,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:17:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:16,080 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:17:16,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:17:16,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938917065] [2022-12-13 04:17:16,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938917065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:17:16,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:17:16,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:17:16,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707116856] [2022-12-13 04:17:16,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:17:16,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 04:17:16,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:17:16,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 04:17:16,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-13 04:17:16,081 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:17:16,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 1031 transitions, 101402 flow. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:16,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:17:16,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:17:16,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:17:19,051 INFO L130 PetriNetUnfolder]: 2268/4169 cut-off events. [2022-12-13 04:17:19,051 INFO L131 PetriNetUnfolder]: For 9195/9195 co-relation queries the response was YES. [2022-12-13 04:17:19,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207813 conditions, 4169 events. 2268/4169 cut-off events. For 9195/9195 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 25954 event pairs, 38 based on Foata normal form. 2/4169 useless extension candidates. Maximal degree in co-relation 141576. Up to 4170 conditions per place. [2022-12-13 04:17:19,109 INFO L137 encePairwiseOnDemand]: 23/36 looper letters, 955 selfloop transitions, 86 changer transitions 80/1121 dead transitions. [2022-12-13 04:17:19,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 1121 transitions, 112438 flow [2022-12-13 04:17:19,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 04:17:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 04:17:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-12-13 04:17:19,111 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3072916666666667 [2022-12-13 04:17:19,111 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 197 predicate places. [2022-12-13 04:17:19,111 INFO L82 GeneralOperation]: Start removeDead. Operand has 238 places, 1121 transitions, 112438 flow [2022-12-13 04:17:19,185 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 234 places, 1041 transitions, 104422 flow [2022-12-13 04:17:19,239 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:17:19,239 INFO L89 Accepts]: Start accepts. Operand has 234 places, 1041 transitions, 104422 flow [2022-12-13 04:17:19,266 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:17:19,267 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:17:19,267 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 1041 transitions, 104422 flow [2022-12-13 04:17:19,298 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 1041 transitions, 104422 flow [2022-12-13 04:17:19,298 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:17:19,300 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:17:19,304 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-13 04:17:19,304 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 1041 transitions, 104422 flow [2022-12-13 04:17:19,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:19,304 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:17:19,304 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] [2022-12-13 04:17:19,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 04:17:19,304 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:17:19,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:17:19,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1977349878, now seen corresponding path program 4 times [2022-12-13 04:17:19,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:17:19,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413860284] [2022-12-13 04:17:19,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:17:19,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:17:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:19,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:17:19,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:17:19,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413860284] [2022-12-13 04:17:19,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413860284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:17:19,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:17:19,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:17:19,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028268805] [2022-12-13 04:17:19,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:17:19,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:17:19,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:17:19,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:17:19,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:17:19,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:17:19,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 1041 transitions, 104422 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:19,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:17:19,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:17:19,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:17:22,473 INFO L130 PetriNetUnfolder]: 2227/4094 cut-off events. [2022-12-13 04:17:22,474 INFO L131 PetriNetUnfolder]: For 8292/8292 co-relation queries the response was YES. [2022-12-13 04:17:22,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208146 conditions, 4094 events. 2227/4094 cut-off events. For 8292/8292 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 25366 event pairs, 42 based on Foata normal form. 2/4094 useless extension candidates. Maximal degree in co-relation 144417. Up to 4095 conditions per place. [2022-12-13 04:17:22,530 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 949 selfloop transitions, 53 changer transitions 99/1101 dead transitions. [2022-12-13 04:17:22,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 1101 transitions, 112628 flow [2022-12-13 04:17:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:17:22,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:17:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2022-12-13 04:17:22,555 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2022-12-13 04:17:22,555 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 203 predicate places. [2022-12-13 04:17:22,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 244 places, 1101 transitions, 112628 flow [2022-12-13 04:17:22,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 1002 transitions, 102522 flow [2022-12-13 04:17:22,838 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:17:22,838 INFO L89 Accepts]: Start accepts. Operand has 239 places, 1002 transitions, 102522 flow [2022-12-13 04:17:22,860 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:17:22,860 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:17:22,860 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 1002 transitions, 102522 flow [2022-12-13 04:17:22,893 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 1002 transitions, 102522 flow [2022-12-13 04:17:22,893 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:17:22,895 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:17:22,895 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-13 04:17:22,895 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 1002 transitions, 102522 flow [2022-12-13 04:17:22,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:22,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:17:22,896 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] [2022-12-13 04:17:22,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 04:17:22,896 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:17:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:17:22,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1399010104, now seen corresponding path program 5 times [2022-12-13 04:17:22,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:17:22,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759423990] [2022-12-13 04:17:22,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:17:22,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:17:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:23,004 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:17:23,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:17:23,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759423990] [2022-12-13 04:17:23,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759423990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:17:23,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:17:23,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:17:23,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913629252] [2022-12-13 04:17:23,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:17:23,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:17:23,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:17:23,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:17:23,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:17:23,006 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:17:23,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 1002 transitions, 102522 flow. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:23,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:17:23,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:17:23,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:17:25,726 INFO L130 PetriNetUnfolder]: 2106/3892 cut-off events. [2022-12-13 04:17:25,726 INFO L131 PetriNetUnfolder]: For 7384/7384 co-relation queries the response was YES. [2022-12-13 04:17:25,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201903 conditions, 3892 events. 2106/3892 cut-off events. For 7384/7384 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 23885 event pairs, 40 based on Foata normal form. 3/3893 useless extension candidates. Maximal degree in co-relation 156906. Up to 3893 conditions per place. [2022-12-13 04:17:25,781 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 943 selfloop transitions, 83 changer transitions 88/1114 dead transitions. [2022-12-13 04:17:25,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 1114 transitions, 116191 flow [2022-12-13 04:17:25,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:17:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:17:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2022-12-13 04:17:25,784 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3765432098765432 [2022-12-13 04:17:25,784 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 206 predicate places. [2022-12-13 04:17:25,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 1114 transitions, 116191 flow [2022-12-13 04:17:25,857 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 241 places, 1026 transitions, 107034 flow [2022-12-13 04:17:26,074 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:17:26,074 INFO L89 Accepts]: Start accepts. Operand has 241 places, 1026 transitions, 107034 flow [2022-12-13 04:17:26,101 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:17:26,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:17:26,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 241 places, 1026 transitions, 107034 flow [2022-12-13 04:17:26,132 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 241 places, 1026 transitions, 107034 flow [2022-12-13 04:17:26,132 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:17:26,134 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:17:26,135 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-13 04:17:26,135 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 1026 transitions, 107034 flow [2022-12-13 04:17:26,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:26,135 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:17:26,135 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] [2022-12-13 04:17:26,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 04:17:26,135 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:17:26,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:17:26,135 INFO L85 PathProgramCache]: Analyzing trace with hash 544107156, now seen corresponding path program 6 times [2022-12-13 04:17:26,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:17:26,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811468983] [2022-12-13 04:17:26,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:17:26,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:17:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:26,639 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:17:26,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:17:26,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811468983] [2022-12-13 04:17:26,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811468983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:17:26,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:17:26,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:17:26,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232876665] [2022-12-13 04:17:26,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:17:26,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:17:26,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:17:26,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:17:26,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:17:26,643 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:17:26,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 1026 transitions, 107034 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:26,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:17:26,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:17:26,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:17:29,526 INFO L130 PetriNetUnfolder]: 2006/3699 cut-off events. [2022-12-13 04:17:29,526 INFO L131 PetriNetUnfolder]: For 6722/6722 co-relation queries the response was YES. [2022-12-13 04:17:29,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195604 conditions, 3699 events. 2006/3699 cut-off events. For 6722/6722 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 22397 event pairs, 40 based on Foata normal form. 2/3699 useless extension candidates. Maximal degree in co-relation 154115. Up to 3700 conditions per place. [2022-12-13 04:17:29,575 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 937 selfloop transitions, 63 changer transitions 51/1051 dead transitions. [2022-12-13 04:17:29,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 1051 transitions, 111754 flow [2022-12-13 04:17:29,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:17:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:17:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2022-12-13 04:17:29,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3207070707070707 [2022-12-13 04:17:29,576 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 210 predicate places. [2022-12-13 04:17:29,576 INFO L82 GeneralOperation]: Start removeDead. Operand has 251 places, 1051 transitions, 111754 flow [2022-12-13 04:17:29,643 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 1000 transitions, 106344 flow [2022-12-13 04:17:29,690 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:17:29,691 INFO L89 Accepts]: Start accepts. Operand has 249 places, 1000 transitions, 106344 flow [2022-12-13 04:17:29,718 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:17:29,718 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:17:29,718 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 249 places, 1000 transitions, 106344 flow [2022-12-13 04:17:29,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 249 places, 1000 transitions, 106344 flow [2022-12-13 04:17:29,746 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:17:29,747 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:17:29,748 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 04:17:29,748 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 1000 transitions, 106344 flow [2022-12-13 04:17:29,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:29,748 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:17:29,748 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] [2022-12-13 04:17:29,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 04:17:29,749 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:17:29,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:17:29,749 INFO L85 PathProgramCache]: Analyzing trace with hash -587829360, now seen corresponding path program 7 times [2022-12-13 04:17:29,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:17:29,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005697825] [2022-12-13 04:17:29,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:17:29,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:17:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:30,195 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:17:30,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:17:30,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005697825] [2022-12-13 04:17:30,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005697825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:17:30,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:17:30,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:17:30,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204276381] [2022-12-13 04:17:30,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:17:30,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:17:30,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:17:30,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:17:30,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:17:30,196 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:17:30,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 1000 transitions, 106344 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:30,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:17:30,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:17:30,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:17:32,834 INFO L130 PetriNetUnfolder]: 1949/3616 cut-off events. [2022-12-13 04:17:32,834 INFO L131 PetriNetUnfolder]: For 6649/6649 co-relation queries the response was YES. [2022-12-13 04:17:32,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194836 conditions, 3616 events. 1949/3616 cut-off events. For 6649/6649 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 21940 event pairs, 38 based on Foata normal form. 2/3616 useless extension candidates. Maximal degree in co-relation 157032. Up to 3617 conditions per place. [2022-12-13 04:17:32,885 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 935 selfloop transitions, 63 changer transitions 28/1026 dead transitions. [2022-12-13 04:17:32,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 1026 transitions, 111176 flow [2022-12-13 04:17:32,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:17:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:17:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2022-12-13 04:17:32,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3055555555555556 [2022-12-13 04:17:32,886 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 218 predicate places. [2022-12-13 04:17:32,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 1026 transitions, 111176 flow [2022-12-13 04:17:32,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 998 transitions, 108134 flow [2022-12-13 04:17:33,007 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:17:33,007 INFO L89 Accepts]: Start accepts. Operand has 257 places, 998 transitions, 108134 flow [2022-12-13 04:17:33,035 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:17:33,036 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:17:33,036 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 257 places, 998 transitions, 108134 flow [2022-12-13 04:17:33,064 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 257 places, 998 transitions, 108134 flow [2022-12-13 04:17:33,065 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:17:36,331 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:17:36,331 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3324 [2022-12-13 04:17:36,331 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 997 transitions, 108026 flow [2022-12-13 04:17:36,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:36,332 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:17:36,332 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] [2022-12-13 04:17:36,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 04:17:36,332 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:17:36,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:17:36,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1270578026, now seen corresponding path program 1 times [2022-12-13 04:17:36,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:17:36,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993189101] [2022-12-13 04:17:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:17:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:17:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:36,939 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:17:36,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:17:36,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993189101] [2022-12-13 04:17:36,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993189101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:17:36,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:17:36,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:17:36,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887306435] [2022-12-13 04:17:36,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:17:36,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:17:36,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:17:36,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:17:36,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:17:36,940 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 04:17:36,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 997 transitions, 108026 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:17:36,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:17:36,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 04:17:36,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:17:39,060 INFO L130 PetriNetUnfolder]: 1936/3564 cut-off events. [2022-12-13 04:17:39,061 INFO L131 PetriNetUnfolder]: For 6592/6592 co-relation queries the response was YES. [2022-12-13 04:17:39,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195587 conditions, 3564 events. 1936/3564 cut-off events. For 6592/6592 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 21381 event pairs, 36 based on Foata normal form. 2/3564 useless extension candidates. Maximal degree in co-relation 159949. Up to 3565 conditions per place. [2022-12-13 04:17:39,116 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 804 selfloop transitions, 41 changer transitions 159/1004 dead transitions. [2022-12-13 04:17:39,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 1004 transitions, 110799 flow [2022-12-13 04:17:39,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:17:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:17:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2022-12-13 04:17:39,117 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33933933933933935 [2022-12-13 04:17:39,117 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 223 predicate places. [2022-12-13 04:17:39,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 264 places, 1004 transitions, 110799 flow [2022-12-13 04:17:39,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 845 transitions, 93292 flow [2022-12-13 04:17:39,242 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:17:39,242 INFO L89 Accepts]: Start accepts. Operand has 201 places, 845 transitions, 93292 flow [2022-12-13 04:17:39,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:17:39,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:17:39,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 845 transitions, 93292 flow [2022-12-13 04:17:39,332 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 845 transitions, 93292 flow [2022-12-13 04:17:39,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:17:39,348 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:17:39,350 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 04:17:39,350 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 845 transitions, 93292 flow [2022-12-13 04:17:39,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:17:39,350 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:17:39,350 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] [2022-12-13 04:17:39,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-13 04:17:39,350 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:17:39,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:17:39,350 INFO L85 PathProgramCache]: Analyzing trace with hash -232914857, now seen corresponding path program 1 times [2022-12-13 04:17:39,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:17:39,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177439039] [2022-12-13 04:17:39,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:17:39,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:17:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:39,981 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:17:39,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:17:39,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177439039] [2022-12-13 04:17:39,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177439039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:17:39,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:17:39,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:17:39,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694722368] [2022-12-13 04:17:39,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:17:39,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:17:39,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:17:39,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:17:39,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:17:39,983 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:17:39,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 845 transitions, 93292 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:39,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:17:39,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:17:39,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:17:44,080 INFO L130 PetriNetUnfolder]: 3989/7266 cut-off events. [2022-12-13 04:17:44,080 INFO L131 PetriNetUnfolder]: For 13867/13867 co-relation queries the response was YES. [2022-12-13 04:17:44,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406028 conditions, 7266 events. 3989/7266 cut-off events. For 13867/13867 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 49779 event pairs, 98 based on Foata normal form. 4/7268 useless extension candidates. Maximal degree in co-relation 199349. Up to 7267 conditions per place. [2022-12-13 04:17:44,189 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 1693 selfloop transitions, 165 changer transitions 96/1954 dead transitions. [2022-12-13 04:17:44,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 1954 transitions, 219755 flow [2022-12-13 04:17:44,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:17:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:17:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2022-12-13 04:17:44,193 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-13 04:17:44,193 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 170 predicate places. [2022-12-13 04:17:44,193 INFO L82 GeneralOperation]: Start removeDead. Operand has 211 places, 1954 transitions, 219755 flow [2022-12-13 04:17:44,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 211 places, 1858 transitions, 208895 flow [2022-12-13 04:17:44,612 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:17:44,613 INFO L89 Accepts]: Start accepts. Operand has 211 places, 1858 transitions, 208895 flow [2022-12-13 04:17:44,660 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:17:44,660 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:17:44,660 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 1858 transitions, 208895 flow [2022-12-13 04:17:44,716 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 1858 transitions, 208895 flow [2022-12-13 04:17:44,716 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:17:44,719 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:17:44,719 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 04:17:44,720 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 1858 transitions, 208895 flow [2022-12-13 04:17:44,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:44,720 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:17:44,720 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] [2022-12-13 04:17:44,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 04:17:44,720 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:17:44,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:17:44,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1840048691, now seen corresponding path program 2 times [2022-12-13 04:17:44,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:17:44,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528509162] [2022-12-13 04:17:44,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:17:44,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:17:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:45,210 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:17:45,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:17:45,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528509162] [2022-12-13 04:17:45,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528509162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:17:45,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:17:45,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:17:45,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611091270] [2022-12-13 04:17:45,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:17:45,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:17:45,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:17:45,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:17:45,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:17:45,211 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:17:45,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 1858 transitions, 208895 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:45,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:17:45,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:17:45,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:17:54,159 INFO L130 PetriNetUnfolder]: 3849/7134 cut-off events. [2022-12-13 04:17:54,159 INFO L131 PetriNetUnfolder]: For 13800/13800 co-relation queries the response was YES. [2022-12-13 04:17:54,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405735 conditions, 7134 events. 3849/7134 cut-off events. For 13800/13800 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 49852 event pairs, 98 based on Foata normal form. 4/7136 useless extension candidates. Maximal degree in co-relation 196273. Up to 7135 conditions per place. [2022-12-13 04:17:54,267 INFO L137 encePairwiseOnDemand]: 22/36 looper letters, 1633 selfloop transitions, 137 changer transitions 148/1918 dead transitions. [2022-12-13 04:17:54,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 1918 transitions, 219511 flow [2022-12-13 04:17:54,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:17:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:17:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 158 transitions. [2022-12-13 04:17:54,268 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.398989898989899 [2022-12-13 04:17:54,268 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 180 predicate places. [2022-12-13 04:17:54,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 221 places, 1918 transitions, 219511 flow [2022-12-13 04:17:54,413 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 219 places, 1770 transitions, 202453 flow [2022-12-13 04:17:54,514 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:17:54,515 INFO L89 Accepts]: Start accepts. Operand has 219 places, 1770 transitions, 202453 flow [2022-12-13 04:17:54,584 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:17:54,585 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:17:54,585 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 1770 transitions, 202453 flow [2022-12-13 04:17:54,641 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 1770 transitions, 202453 flow [2022-12-13 04:17:54,641 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:17:54,656 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:17:54,684 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:17:54,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:17:54,741 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:17:54,764 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:17:54,765 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 251 [2022-12-13 04:17:54,765 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 1769 transitions, 202361 flow [2022-12-13 04:17:54,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:54,765 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:17:54,765 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] [2022-12-13 04:17:54,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-13 04:17:54,765 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:17:54,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:17:54,765 INFO L85 PathProgramCache]: Analyzing trace with hash -732778467, now seen corresponding path program 3 times [2022-12-13 04:17:54,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:17:54,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305570085] [2022-12-13 04:17:54,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:17:54,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:17:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:55,355 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:17:55,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:17:55,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305570085] [2022-12-13 04:17:55,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305570085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:17:55,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:17:55,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:17:55,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111047288] [2022-12-13 04:17:55,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:17:55,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:17:55,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:17:55,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:17:55,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:17:55,356 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 04:17:55,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 1769 transitions, 202361 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:55,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:17:55,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 04:17:55,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:18:02,811 INFO L130 PetriNetUnfolder]: 3848/7203 cut-off events. [2022-12-13 04:18:02,811 INFO L131 PetriNetUnfolder]: For 12231/12231 co-relation queries the response was YES. [2022-12-13 04:18:02,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416830 conditions, 7203 events. 3848/7203 cut-off events. For 12231/12231 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 51254 event pairs, 88 based on Foata normal form. 4/7205 useless extension candidates. Maximal degree in co-relation 203685. Up to 7204 conditions per place. [2022-12-13 04:18:02,918 INFO L137 encePairwiseOnDemand]: 26/44 looper letters, 1610 selfloop transitions, 123 changer transitions 197/1930 dead transitions. [2022-12-13 04:18:02,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 1930 transitions, 224645 flow [2022-12-13 04:18:02,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:18:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:18:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2022-12-13 04:18:02,919 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34710743801652894 [2022-12-13 04:18:02,919 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 186 predicate places. [2022-12-13 04:18:02,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 1930 transitions, 224645 flow [2022-12-13 04:18:03,179 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 1733 transitions, 201696 flow [2022-12-13 04:18:03,279 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:18:03,279 INFO L89 Accepts]: Start accepts. Operand has 223 places, 1733 transitions, 201696 flow [2022-12-13 04:18:03,347 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:18:03,347 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:18:03,347 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 1733 transitions, 201696 flow [2022-12-13 04:18:03,400 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 1733 transitions, 201696 flow [2022-12-13 04:18:03,401 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:18:03,403 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:18:03,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 04:18:03,404 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 1733 transitions, 201696 flow [2022-12-13 04:18:03,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:18:03,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:18:03,404 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] [2022-12-13 04:18:03,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-13 04:18:03,404 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:18:03,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:18:03,405 INFO L85 PathProgramCache]: Analyzing trace with hash 923838491, now seen corresponding path program 1 times [2022-12-13 04:18:03,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:18:03,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139565252] [2022-12-13 04:18:03,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:18:03,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:18:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:18:04,250 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:18:04,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:18:04,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139565252] [2022-12-13 04:18:04,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139565252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:18:04,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:18:04,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:18:04,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408173244] [2022-12-13 04:18:04,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:18:04,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:18:04,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:18:04,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:18:04,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:18:04,251 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 04:18:04,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 1733 transitions, 201696 flow. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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:18:04,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:18:04,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 04:18:04,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:18:12,102 INFO L130 PetriNetUnfolder]: 3810/7179 cut-off events. [2022-12-13 04:18:12,102 INFO L131 PetriNetUnfolder]: For 11446/11446 co-relation queries the response was YES. [2022-12-13 04:18:12,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422694 conditions, 7179 events. 3810/7179 cut-off events. For 11446/11446 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 51534 event pairs, 70 based on Foata normal form. 4/7181 useless extension candidates. Maximal degree in co-relation 198296. Up to 7180 conditions per place. [2022-12-13 04:18:12,204 INFO L137 encePairwiseOnDemand]: 24/44 looper letters, 1675 selfloop transitions, 186 changer transitions 124/1985 dead transitions. [2022-12-13 04:18:12,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 1985 transitions, 235074 flow [2022-12-13 04:18:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:18:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:18:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2022-12-13 04:18:12,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3768939393939394 [2022-12-13 04:18:12,205 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 193 predicate places. [2022-12-13 04:18:12,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 234 places, 1985 transitions, 235074 flow [2022-12-13 04:18:12,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 1861 transitions, 220334 flow [2022-12-13 04:18:12,454 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:18:12,455 INFO L89 Accepts]: Start accepts. Operand has 231 places, 1861 transitions, 220334 flow [2022-12-13 04:18:12,532 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:18:12,532 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:18:12,532 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 1861 transitions, 220334 flow [2022-12-13 04:18:12,649 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 231 places, 1861 transitions, 220334 flow [2022-12-13 04:18:12,649 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:18:12,652 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:18:12,653 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-13 04:18:12,653 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 1861 transitions, 220334 flow [2022-12-13 04:18:12,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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:18:12,653 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:18:12,653 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] [2022-12-13 04:18:12,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-13 04:18:12,653 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:18:12,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:18:12,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2079790458, now seen corresponding path program 1 times [2022-12-13 04:18:12,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:18:12,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517243940] [2022-12-13 04:18:12,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:18:12,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:18:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:18:13,189 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:18:13,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:18:13,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517243940] [2022-12-13 04:18:13,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517243940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:18:13,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:18:13,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:18:13,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717210185] [2022-12-13 04:18:13,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:18:13,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:18:13,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:18:13,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:18:13,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:18:13,191 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 04:18:13,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 1861 transitions, 220334 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:18:13,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:18:13,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 04:18:13,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:18:21,358 INFO L130 PetriNetUnfolder]: 3746/7089 cut-off events. [2022-12-13 04:18:21,358 INFO L131 PetriNetUnfolder]: For 11480/11480 co-relation queries the response was YES. [2022-12-13 04:18:21,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424472 conditions, 7089 events. 3746/7089 cut-off events. For 11480/11480 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 50829 event pairs, 86 based on Foata normal form. 4/7091 useless extension candidates. Maximal degree in co-relation 191678. Up to 7090 conditions per place. [2022-12-13 04:18:21,469 INFO L137 encePairwiseOnDemand]: 22/40 looper letters, 1802 selfloop transitions, 131 changer transitions 80/2013 dead transitions. [2022-12-13 04:18:21,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 2013 transitions, 242458 flow [2022-12-13 04:18:21,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 04:18:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 04:18:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 196 transitions. [2022-12-13 04:18:21,470 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3769230769230769 [2022-12-13 04:18:21,471 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 202 predicate places. [2022-12-13 04:18:21,471 INFO L82 GeneralOperation]: Start removeDead. Operand has 243 places, 2013 transitions, 242458 flow [2022-12-13 04:18:21,735 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 242 places, 1933 transitions, 232786 flow [2022-12-13 04:18:21,838 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:18:21,838 INFO L89 Accepts]: Start accepts. Operand has 242 places, 1933 transitions, 232786 flow [2022-12-13 04:18:21,926 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:18:21,926 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:18:21,926 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 242 places, 1933 transitions, 232786 flow [2022-12-13 04:18:21,998 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 242 places, 1933 transitions, 232786 flow [2022-12-13 04:18:21,998 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:18:22,001 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:18:22,002 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-13 04:18:22,002 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 1933 transitions, 232786 flow [2022-12-13 04:18:22,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:18:22,002 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:18:22,002 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] [2022-12-13 04:18:22,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-13 04:18:22,002 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:18:22,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:18:22,003 INFO L85 PathProgramCache]: Analyzing trace with hash -128716730, now seen corresponding path program 2 times [2022-12-13 04:18:22,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:18:22,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941451123] [2022-12-13 04:18:22,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:18:22,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:18:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:18:22,610 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:18:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:18:22,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941451123] [2022-12-13 04:18:22,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941451123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:18:22,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:18:22,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:18:22,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835524996] [2022-12-13 04:18:22,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:18:22,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:18:22,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:18:22,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:18:22,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:18:22,612 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 04:18:22,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 1933 transitions, 232786 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:18:22,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:18:22,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 04:18:22,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:18:30,710 INFO L130 PetriNetUnfolder]: 3668/6891 cut-off events. [2022-12-13 04:18:30,710 INFO L131 PetriNetUnfolder]: For 11402/11402 co-relation queries the response was YES. [2022-12-13 04:18:30,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419450 conditions, 6891 events. 3668/6891 cut-off events. For 11402/11402 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 48760 event pairs, 82 based on Foata normal form. 4/6893 useless extension candidates. Maximal degree in co-relation 183752. Up to 6892 conditions per place. [2022-12-13 04:18:30,807 INFO L137 encePairwiseOnDemand]: 23/40 looper letters, 1472 selfloop transitions, 82 changer transitions 375/1929 dead transitions. [2022-12-13 04:18:30,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 1929 transitions, 236164 flow [2022-12-13 04:18:30,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:18:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:18:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2022-12-13 04:18:30,808 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-13 04:18:30,808 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 210 predicate places. [2022-12-13 04:18:30,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 251 places, 1929 transitions, 236164 flow [2022-12-13 04:18:30,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 1554 transitions, 190150 flow [2022-12-13 04:18:31,043 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:18:31,043 INFO L89 Accepts]: Start accepts. Operand has 246 places, 1554 transitions, 190150 flow [2022-12-13 04:18:31,102 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:18:31,103 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:18:31,103 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 246 places, 1554 transitions, 190150 flow [2022-12-13 04:18:31,154 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 246 places, 1554 transitions, 190150 flow [2022-12-13 04:18:31,154 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:18:31,204 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [729] L65-->L71: Formula: (and (= (select (select |v_#memory_int_262| v_~f~0.base_137) (+ v_~f~0.offset_137 (* v_~i1~0_93 4))) v_~i~0_248) (= v_~i1~0_93 v_~i~0_249)) InVars {~i~0=v_~i~0_249, ~f~0.base=v_~f~0.base_137, #memory_int=|v_#memory_int_262|, ~f~0.offset=v_~f~0.offset_137} OutVars{~i~0=v_~i~0_248, ~f~0.base=v_~f~0.base_137, #memory_int=|v_#memory_int_262|, ~i1~0=v_~i1~0_93, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_29|, ~f~0.offset=v_~f~0.offset_137} AuxVars[] AssignedVars[~i~0, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 04:18:31,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [602] L74-->thread1EXIT: Formula: (and (= v_~n1~0_58 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_9| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_9| 0)) InVars {} OutVars{~n1~0=v_~n1~0_58, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_9|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_9|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 04:18:31,315 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [730] L65-->L74: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63| (ite (and (<= 0 v_~i~0_252) (< v_~i~0_252 v_~n~0_120)) 1 0)) (= v_~i1~0_95 v_~i~0_253) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63| 0)) (= (select (select |v_#memory_int_264| v_~f~0.base_139) (+ v_~f~0.offset_139 (* v_~i1~0_95 4))) v_~i~0_252) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|)) InVars {~i~0=v_~i~0_253, ~f~0.base=v_~f~0.base_139, #memory_int=|v_#memory_int_264|, ~n~0=v_~n~0_120, ~f~0.offset=v_~f~0.offset_139} OutVars{~i~0=v_~i~0_252, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|, ~f~0.base=v_~f~0.base_139, #memory_int=|v_#memory_int_264|, ~i1~0=v_~i1~0_95, ~n~0=v_~n~0_120, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_31|, ~f~0.offset=v_~f~0.offset_139, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 04:18:31,360 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 04:18:31,361 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 318 [2022-12-13 04:18:31,361 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 1550 transitions, 189682 flow [2022-12-13 04:18:31,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:18:31,361 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:18:31,361 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] [2022-12-13 04:18:31,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-13 04:18:31,361 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:18:31,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:18:31,361 INFO L85 PathProgramCache]: Analyzing trace with hash -267464425, now seen corresponding path program 4 times [2022-12-13 04:18:31,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:18:31,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674130021] [2022-12-13 04:18:31,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:18:31,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:18:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:18:32,443 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:18:32,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:18:32,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674130021] [2022-12-13 04:18:32,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674130021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:18:32,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:18:32,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:18:32,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778136249] [2022-12-13 04:18:32,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:18:32,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:18:32,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:18:32,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:18:32,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:18:32,445 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:18:32,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 1550 transitions, 189682 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:18:32,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:18:32,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:18:32,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:18:38,789 INFO L130 PetriNetUnfolder]: 3299/6163 cut-off events. [2022-12-13 04:18:38,790 INFO L131 PetriNetUnfolder]: For 11466/11466 co-relation queries the response was YES. [2022-12-13 04:18:38,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381373 conditions, 6163 events. 3299/6163 cut-off events. For 11466/11466 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 42055 event pairs, 60 based on Foata normal form. 8/6167 useless extension candidates. Maximal degree in co-relation 204779. Up to 6164 conditions per place. [2022-12-13 04:18:38,869 INFO L137 encePairwiseOnDemand]: 23/39 looper letters, 1247 selfloop transitions, 56 changer transitions 545/1848 dead transitions. [2022-12-13 04:18:38,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 1848 transitions, 229816 flow [2022-12-13 04:18:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 04:18:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 04:18:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 199 transitions. [2022-12-13 04:18:38,870 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30015082956259426 [2022-12-13 04:18:38,871 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 205 predicate places. [2022-12-13 04:18:38,871 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 1848 transitions, 229816 flow [2022-12-13 04:18:39,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 236 places, 1303 transitions, 162076 flow [2022-12-13 04:18:39,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:18:39,185 INFO L89 Accepts]: Start accepts. Operand has 236 places, 1303 transitions, 162076 flow [2022-12-13 04:18:39,243 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:18:39,243 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:18:39,243 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 1303 transitions, 162076 flow [2022-12-13 04:18:39,287 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 236 places, 1303 transitions, 162076 flow [2022-12-13 04:18:39,287 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:18:39,289 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:18:39,290 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 04:18:39,290 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 1303 transitions, 162076 flow [2022-12-13 04:18:39,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:18:39,290 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:18:39,290 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] [2022-12-13 04:18:39,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-13 04:18:39,290 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:18:39,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:18:39,291 INFO L85 PathProgramCache]: Analyzing trace with hash 787905915, now seen corresponding path program 1 times [2022-12-13 04:18:39,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:18:39,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664013543] [2022-12-13 04:18:39,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:18:39,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:18:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:18:39,844 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:18:39,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:18:39,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664013543] [2022-12-13 04:18:39,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664013543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:18:39,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:18:39,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:18:39,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255585436] [2022-12-13 04:18:39,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:18:39,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:18:39,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:18:39,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:18:39,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:18:39,845 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:18:39,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 1303 transitions, 162076 flow. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:18:39,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:18:39,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:18:39,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:18:44,266 INFO L130 PetriNetUnfolder]: 2594/4868 cut-off events. [2022-12-13 04:18:44,266 INFO L131 PetriNetUnfolder]: For 10307/10307 co-relation queries the response was YES. [2022-12-13 04:18:44,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306283 conditions, 4868 events. 2594/4868 cut-off events. For 10307/10307 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 31934 event pairs, 44 based on Foata normal form. 2/4866 useless extension candidates. Maximal degree in co-relation 166100. Up to 4869 conditions per place. [2022-12-13 04:18:44,346 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 1364 selfloop transitions, 59 changer transitions 32/1455 dead transitions. [2022-12-13 04:18:44,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 1455 transitions, 183955 flow [2022-12-13 04:18:44,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:18:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:18:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2022-12-13 04:18:44,347 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3923076923076923 [2022-12-13 04:18:44,347 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 204 predicate places. [2022-12-13 04:18:44,347 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 1455 transitions, 183955 flow [2022-12-13 04:18:44,461 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 244 places, 1423 transitions, 179893 flow [2022-12-13 04:18:44,668 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:18:44,669 INFO L89 Accepts]: Start accepts. Operand has 244 places, 1423 transitions, 179893 flow [2022-12-13 04:18:44,720 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:18:44,720 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:18:44,720 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 1423 transitions, 179893 flow [2022-12-13 04:18:44,767 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 244 places, 1423 transitions, 179893 flow [2022-12-13 04:18:44,767 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:18:44,769 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:18:44,770 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 04:18:44,770 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 1423 transitions, 179893 flow [2022-12-13 04:18:44,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:18:44,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:18:44,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] [2022-12-13 04:18:44,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-13 04:18:44,771 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:18:44,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:18:44,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1808183689, now seen corresponding path program 2 times [2022-12-13 04:18:44,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:18:44,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837565176] [2022-12-13 04:18:44,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:18:44,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:18:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:18:45,336 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:18:45,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:18:45,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837565176] [2022-12-13 04:18:45,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837565176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:18:45,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:18:45,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:18:45,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281659595] [2022-12-13 04:18:45,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:18:45,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:18:45,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:18:45,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:18:45,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:18:45,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:18:45,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 1423 transitions, 179893 flow. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:18:45,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:18:45,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:18:45,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:18:50,386 INFO L130 PetriNetUnfolder]: 2623/4941 cut-off events. [2022-12-13 04:18:50,386 INFO L131 PetriNetUnfolder]: For 10114/10114 co-relation queries the response was YES. [2022-12-13 04:18:50,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315777 conditions, 4941 events. 2623/4941 cut-off events. For 10114/10114 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 32789 event pairs, 44 based on Foata normal form. 2/4939 useless extension candidates. Maximal degree in co-relation 168742. Up to 4942 conditions per place. [2022-12-13 04:18:50,463 INFO L137 encePairwiseOnDemand]: 28/39 looper letters, 1373 selfloop transitions, 43 changer transitions 66/1482 dead transitions. [2022-12-13 04:18:50,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 1482 transitions, 190319 flow [2022-12-13 04:18:50,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:18:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:18:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2022-12-13 04:18:50,464 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39886039886039887 [2022-12-13 04:18:50,464 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 211 predicate places. [2022-12-13 04:18:50,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 252 places, 1482 transitions, 190319 flow [2022-12-13 04:18:50,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 1416 transitions, 181843 flow [2022-12-13 04:18:50,649 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:18:50,649 INFO L89 Accepts]: Start accepts. Operand has 249 places, 1416 transitions, 181843 flow [2022-12-13 04:18:50,717 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:18:50,717 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:18:50,717 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 249 places, 1416 transitions, 181843 flow [2022-12-13 04:18:50,764 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 249 places, 1416 transitions, 181843 flow [2022-12-13 04:18:50,764 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:18:50,767 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:18:50,767 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 04:18:50,767 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 1416 transitions, 181843 flow [2022-12-13 04:18:50,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:18:50,768 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:18:50,768 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] [2022-12-13 04:18:50,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-13 04:18:50,768 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:18:50,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:18:50,768 INFO L85 PathProgramCache]: Analyzing trace with hash 483751575, now seen corresponding path program 3 times [2022-12-13 04:18:50,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:18:50,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087779881] [2022-12-13 04:18:50,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:18:50,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:18:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:18:51,452 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:18:51,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:18:51,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087779881] [2022-12-13 04:18:51,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087779881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:18:51,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:18:51,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:18:51,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613642396] [2022-12-13 04:18:51,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:18:51,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:18:51,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:18:51,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:18:51,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:18:51,457 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:18:51,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 1416 transitions, 181843 flow. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:18:51,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:18:51,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:18:51,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:18:56,003 INFO L130 PetriNetUnfolder]: 2526/4760 cut-off events. [2022-12-13 04:18:56,003 INFO L131 PetriNetUnfolder]: For 9695/9695 co-relation queries the response was YES. [2022-12-13 04:18:56,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308989 conditions, 4760 events. 2526/4760 cut-off events. For 9695/9695 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 31287 event pairs, 44 based on Foata normal form. 2/4758 useless extension candidates. Maximal degree in co-relation 171384. Up to 4761 conditions per place. [2022-12-13 04:18:56,083 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 1281 selfloop transitions, 48 changer transitions 85/1414 dead transitions. [2022-12-13 04:18:56,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 1414 transitions, 184415 flow [2022-12-13 04:18:56,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:18:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:18:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2022-12-13 04:18:56,084 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4017094017094017 [2022-12-13 04:18:56,085 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 216 predicate places. [2022-12-13 04:18:56,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 257 places, 1414 transitions, 184415 flow [2022-12-13 04:18:56,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 1329 transitions, 173266 flow [2022-12-13 04:18:56,413 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:18:56,413 INFO L89 Accepts]: Start accepts. Operand has 255 places, 1329 transitions, 173266 flow [2022-12-13 04:18:56,458 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:18:56,458 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:18:56,459 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 255 places, 1329 transitions, 173266 flow [2022-12-13 04:18:56,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 255 places, 1329 transitions, 173266 flow [2022-12-13 04:18:56,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:18:56,524 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:18:56,525 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 04:18:56,525 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 1328 transitions, 173150 flow [2022-12-13 04:18:56,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:18:56,525 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:18:56,525 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] [2022-12-13 04:18:56,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-13 04:18:56,525 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:18:56,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:18:56,526 INFO L85 PathProgramCache]: Analyzing trace with hash -647069658, now seen corresponding path program 1 times [2022-12-13 04:18:56,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:18:56,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264480200] [2022-12-13 04:18:56,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:18:56,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:18:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:18:56,975 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:18:56,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:18:56,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264480200] [2022-12-13 04:18:56,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264480200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:18:56,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:18:56,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:18:56,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047792946] [2022-12-13 04:18:56,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:18:56,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:18:56,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:18:56,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:18:56,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:18:56,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 04:18:56,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 1328 transitions, 173150 flow. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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:18:56,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:18:56,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 04:18:56,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:19:02,131 INFO L130 PetriNetUnfolder]: 2450/4615 cut-off events. [2022-12-13 04:19:02,132 INFO L131 PetriNetUnfolder]: For 9076/9076 co-relation queries the response was YES. [2022-12-13 04:19:02,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304223 conditions, 4615 events. 2450/4615 cut-off events. For 9076/9076 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 30021 event pairs, 44 based on Foata normal form. 2/4613 useless extension candidates. Maximal degree in co-relation 174026. Up to 4616 conditions per place. [2022-12-13 04:19:02,212 INFO L137 encePairwiseOnDemand]: 29/41 looper letters, 1262 selfloop transitions, 39 changer transitions 77/1378 dead transitions. [2022-12-13 04:19:02,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 1378 transitions, 182460 flow [2022-12-13 04:19:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:19:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:19:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-12-13 04:19:02,213 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2022-12-13 04:19:02,213 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 219 predicate places. [2022-12-13 04:19:02,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 260 places, 1378 transitions, 182460 flow [2022-12-13 04:19:02,455 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 252 places, 1301 transitions, 172232 flow [2022-12-13 04:19:02,526 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:19:02,526 INFO L89 Accepts]: Start accepts. Operand has 252 places, 1301 transitions, 172232 flow [2022-12-13 04:19:02,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:19:02,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:19:02,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 252 places, 1301 transitions, 172232 flow [2022-12-13 04:19:02,630 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 1301 transitions, 172232 flow [2022-12-13 04:19:02,630 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:19:02,632 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:19:02,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 04:19:02,633 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 1301 transitions, 172232 flow [2022-12-13 04:19:02,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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:19:02,633 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:19:02,633 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] [2022-12-13 04:19:02,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-13 04:19:02,633 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:19:02,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:19:02,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2001189075, now seen corresponding path program 1 times [2022-12-13 04:19:02,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:19:02,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971076733] [2022-12-13 04:19:02,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:19:02,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:19:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:19:03,113 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:19:03,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:19:03,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971076733] [2022-12-13 04:19:03,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971076733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:19:03,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:19:03,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:19:03,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633675966] [2022-12-13 04:19:03,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:19:03,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:19:03,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:19:03,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:19:03,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:19:03,114 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 04:19:03,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 1301 transitions, 172232 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:19:03,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:19:03,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 04:19:03,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:19:08,008 INFO L130 PetriNetUnfolder]: 2456/4640 cut-off events. [2022-12-13 04:19:08,008 INFO L131 PetriNetUnfolder]: For 9599/9599 co-relation queries the response was YES. [2022-12-13 04:19:08,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310520 conditions, 4640 events. 2456/4640 cut-off events. For 9599/9599 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 30176 event pairs, 36 based on Foata normal form. 2/4640 useless extension candidates. Maximal degree in co-relation 176668. Up to 4641 conditions per place. [2022-12-13 04:19:08,081 INFO L137 encePairwiseOnDemand]: 26/37 looper letters, 1316 selfloop transitions, 63 changer transitions 32/1411 dead transitions. [2022-12-13 04:19:08,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 1411 transitions, 189682 flow [2022-12-13 04:19:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:19:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:19:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 159 transitions. [2022-12-13 04:19:08,082 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3906633906633907 [2022-12-13 04:19:08,082 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 221 predicate places. [2022-12-13 04:19:08,082 INFO L82 GeneralOperation]: Start removeDead. Operand has 262 places, 1411 transitions, 189682 flow [2022-12-13 04:19:08,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 261 places, 1379 transitions, 185364 flow [2022-12-13 04:19:08,261 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:19:08,261 INFO L89 Accepts]: Start accepts. Operand has 261 places, 1379 transitions, 185364 flow [2022-12-13 04:19:08,334 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:19:08,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:19:08,334 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 1379 transitions, 185364 flow [2022-12-13 04:19:08,381 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 1379 transitions, 185364 flow [2022-12-13 04:19:08,381 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:19:08,383 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:19:08,383 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 04:19:08,383 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 1379 transitions, 185364 flow [2022-12-13 04:19:08,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:19:08,383 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:19:08,383 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] [2022-12-13 04:19:08,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-13 04:19:08,384 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:19:08,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:19:08,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1986427239, now seen corresponding path program 2 times [2022-12-13 04:19:08,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:19:08,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127306467] [2022-12-13 04:19:08,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:19:08,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:19:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:19:08,966 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:19:08,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:19:08,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127306467] [2022-12-13 04:19:08,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127306467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:19:08,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:19:08,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:19:08,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426065232] [2022-12-13 04:19:08,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:19:08,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:19:08,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:19:08,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:19:08,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:19:08,967 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 04:19:08,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 1379 transitions, 185364 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:19:08,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:19:08,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 04:19:08,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:19:13,315 INFO L130 PetriNetUnfolder]: 2442/4618 cut-off events. [2022-12-13 04:19:13,315 INFO L131 PetriNetUnfolder]: For 9373/9373 co-relation queries the response was YES. [2022-12-13 04:19:13,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313663 conditions, 4618 events. 2442/4618 cut-off events. For 9373/9373 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 30030 event pairs, 36 based on Foata normal form. 2/4618 useless extension candidates. Maximal degree in co-relation 179310. Up to 4619 conditions per place. [2022-12-13 04:19:13,394 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 1291 selfloop transitions, 44 changer transitions 72/1407 dead transitions. [2022-12-13 04:19:13,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 1407 transitions, 191960 flow [2022-12-13 04:19:13,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:19:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:19:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2022-12-13 04:19:13,395 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3972972972972973 [2022-12-13 04:19:13,395 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 229 predicate places. [2022-12-13 04:19:13,395 INFO L82 GeneralOperation]: Start removeDead. Operand has 270 places, 1407 transitions, 191960 flow [2022-12-13 04:19:13,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 1335 transitions, 182140 flow [2022-12-13 04:19:13,710 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:19:13,710 INFO L89 Accepts]: Start accepts. Operand has 267 places, 1335 transitions, 182140 flow [2022-12-13 04:19:13,772 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:19:13,773 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:19:13,773 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 267 places, 1335 transitions, 182140 flow [2022-12-13 04:19:13,819 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 267 places, 1335 transitions, 182140 flow [2022-12-13 04:19:13,819 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:19:13,821 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:19:13,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 04:19:13,821 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 1335 transitions, 182140 flow [2022-12-13 04:19:13,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:19:13,822 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:19:13,822 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] [2022-12-13 04:19:13,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-13 04:19:13,822 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:19:13,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:19:13,822 INFO L85 PathProgramCache]: Analyzing trace with hash 305508025, now seen corresponding path program 3 times [2022-12-13 04:19:13,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:19:13,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721266416] [2022-12-13 04:19:13,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:19:13,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:19:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:19:14,437 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:19:14,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:19:14,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721266416] [2022-12-13 04:19:14,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721266416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:19:14,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:19:14,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:19:14,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335184606] [2022-12-13 04:19:14,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:19:14,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:19:14,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:19:14,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:19:14,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:19:14,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 04:19:14,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 1335 transitions, 182140 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:19:14,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:19:14,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 04:19:14,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:19:18,565 INFO L130 PetriNetUnfolder]: 2327/4411 cut-off events. [2022-12-13 04:19:18,565 INFO L131 PetriNetUnfolder]: For 8950/8950 co-relation queries the response was YES. [2022-12-13 04:19:18,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304034 conditions, 4411 events. 2327/4411 cut-off events. For 8950/8950 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 28506 event pairs, 38 based on Foata normal form. 2/4411 useless extension candidates. Maximal degree in co-relation 181952. Up to 4412 conditions per place. [2022-12-13 04:19:18,635 INFO L137 encePairwiseOnDemand]: 26/37 looper letters, 1190 selfloop transitions, 49 changer transitions 94/1333 dead transitions. [2022-12-13 04:19:18,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 1333 transitions, 184534 flow [2022-12-13 04:19:18,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:19:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:19:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2022-12-13 04:19:18,636 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3945945945945946 [2022-12-13 04:19:18,636 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 235 predicate places. [2022-12-13 04:19:18,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 1333 transitions, 184534 flow [2022-12-13 04:19:18,737 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 1239 transitions, 171454 flow [2022-12-13 04:19:18,886 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:19:18,886 INFO L89 Accepts]: Start accepts. Operand has 274 places, 1239 transitions, 171454 flow [2022-12-13 04:19:18,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:19:18,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:19:18,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 274 places, 1239 transitions, 171454 flow [2022-12-13 04:19:18,975 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 274 places, 1239 transitions, 171454 flow [2022-12-13 04:19:18,975 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:19:18,997 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:19:18,998 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 04:19:18,998 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 1238 transitions, 171330 flow [2022-12-13 04:19:18,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:19:18,998 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:19:18,998 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] [2022-12-13 04:19:18,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-13 04:19:18,998 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:19:18,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:19:18,998 INFO L85 PathProgramCache]: Analyzing trace with hash -828688891, now seen corresponding path program 1 times [2022-12-13 04:19:18,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:19:18,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911165666] [2022-12-13 04:19:18,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:19:18,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:19:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:19:19,583 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:19:19,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:19:19,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911165666] [2022-12-13 04:19:19,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911165666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:19:19,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:19:19,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:19:19,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901726215] [2022-12-13 04:19:19,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:19:19,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:19:19,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:19:19,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:19:19,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:19:19,584 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:19:19,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 1238 transitions, 171330 flow. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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:19:19,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:19:19,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:19:19,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:19:23,308 INFO L130 PetriNetUnfolder]: 2177/4122 cut-off events. [2022-12-13 04:19:23,308 INFO L131 PetriNetUnfolder]: For 8284/8284 co-relation queries the response was YES. [2022-12-13 04:19:23,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288224 conditions, 4122 events. 2177/4122 cut-off events. For 8284/8284 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 26107 event pairs, 36 based on Foata normal form. 2/4122 useless extension candidates. Maximal degree in co-relation 184594. Up to 4123 conditions per place. [2022-12-13 04:19:23,374 INFO L137 encePairwiseOnDemand]: 28/39 looper letters, 1118 selfloop transitions, 38 changer transitions 87/1243 dead transitions. [2022-12-13 04:19:23,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 1243 transitions, 174515 flow [2022-12-13 04:19:23,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:19:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:19:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2022-12-13 04:19:23,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3789173789173789 [2022-12-13 04:19:23,375 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 239 predicate places. [2022-12-13 04:19:23,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 280 places, 1243 transitions, 174515 flow [2022-12-13 04:19:23,471 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 1156 transitions, 162270 flow [2022-12-13 04:19:23,580 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:19:23,580 INFO L89 Accepts]: Start accepts. Operand has 263 places, 1156 transitions, 162270 flow [2022-12-13 04:19:23,618 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:19:23,618 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:19:23,618 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 263 places, 1156 transitions, 162270 flow [2022-12-13 04:19:23,658 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 1156 transitions, 162270 flow [2022-12-13 04:19:23,659 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:19:23,660 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:19:23,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-13 04:19:23,661 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 1156 transitions, 162270 flow [2022-12-13 04:19:23,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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:19:23,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:19:23,661 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] [2022-12-13 04:19:23,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-13 04:19:23,661 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:19:23,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:19:23,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1808297368, now seen corresponding path program 1 times [2022-12-13 04:19:23,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:19:23,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545793714] [2022-12-13 04:19:23,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:19:23,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:19:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:19:24,299 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:19:24,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:19:24,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545793714] [2022-12-13 04:19:24,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545793714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:19:24,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:19:24,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:19:24,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592615323] [2022-12-13 04:19:24,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:19:24,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:19:24,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:19:24,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:19:24,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:19:24,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:19:24,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 1156 transitions, 162270 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:24,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:19:24,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:19:24,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:19:28,196 INFO L130 PetriNetUnfolder]: 2112/3941 cut-off events. [2022-12-13 04:19:28,196 INFO L131 PetriNetUnfolder]: For 8241/8241 co-relation queries the response was YES. [2022-12-13 04:19:28,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279459 conditions, 3941 events. 2112/3941 cut-off events. For 8241/8241 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 24418 event pairs, 40 based on Foata normal form. 2/3941 useless extension candidates. Maximal degree in co-relation 187236. Up to 3942 conditions per place. [2022-12-13 04:19:28,267 INFO L137 encePairwiseOnDemand]: 24/36 looper letters, 1053 selfloop transitions, 74 changer transitions 42/1169 dead transitions. [2022-12-13 04:19:28,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 1169 transitions, 166437 flow [2022-12-13 04:19:28,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:19:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:19:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2022-12-13 04:19:28,268 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3686868686868687 [2022-12-13 04:19:28,268 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 232 predicate places. [2022-12-13 04:19:28,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 273 places, 1169 transitions, 166437 flow [2022-12-13 04:19:28,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 272 places, 1127 transitions, 160425 flow [2022-12-13 04:19:28,462 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:19:28,462 INFO L89 Accepts]: Start accepts. Operand has 272 places, 1127 transitions, 160425 flow [2022-12-13 04:19:28,501 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:19:28,501 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:19:28,501 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 272 places, 1127 transitions, 160425 flow [2022-12-13 04:19:28,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 1127 transitions, 160425 flow [2022-12-13 04:19:28,541 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:19:28,543 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:19:28,543 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-13 04:19:28,543 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 1127 transitions, 160425 flow [2022-12-13 04:19:28,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:28,543 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:19:28,544 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] [2022-12-13 04:19:28,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-13 04:19:28,544 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:19:28,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:19:28,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1119756822, now seen corresponding path program 2 times [2022-12-13 04:19:28,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:19:28,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895650697] [2022-12-13 04:19:28,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:19:28,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:19:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:19:29,142 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:19:29,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:19:29,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895650697] [2022-12-13 04:19:29,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895650697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:19:29,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:19:29,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:19:29,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610889548] [2022-12-13 04:19:29,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:19:29,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:19:29,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:19:29,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:19:29,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:19:29,143 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:19:29,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 1127 transitions, 160425 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:29,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:19:29,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:19:29,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:19:32,681 INFO L130 PetriNetUnfolder]: 2106/3963 cut-off events. [2022-12-13 04:19:32,681 INFO L131 PetriNetUnfolder]: For 8160/8160 co-relation queries the response was YES. [2022-12-13 04:19:32,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284951 conditions, 3963 events. 2106/3963 cut-off events. For 8160/8160 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 24880 event pairs, 38 based on Foata normal form. 2/3963 useless extension candidates. Maximal degree in co-relation 189878. Up to 3964 conditions per place. [2022-12-13 04:19:32,746 INFO L137 encePairwiseOnDemand]: 24/36 looper letters, 1024 selfloop transitions, 61 changer transitions 89/1174 dead transitions. [2022-12-13 04:19:32,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 1174 transitions, 169451 flow [2022-12-13 04:19:32,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:19:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:19:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 147 transitions. [2022-12-13 04:19:32,747 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2022-12-13 04:19:32,747 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 242 predicate places. [2022-12-13 04:19:32,747 INFO L82 GeneralOperation]: Start removeDead. Operand has 283 places, 1174 transitions, 169451 flow [2022-12-13 04:19:32,951 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 280 places, 1085 transitions, 156589 flow [2022-12-13 04:19:33,039 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:19:33,039 INFO L89 Accepts]: Start accepts. Operand has 280 places, 1085 transitions, 156589 flow [2022-12-13 04:19:33,084 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:19:33,084 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:19:33,084 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 280 places, 1085 transitions, 156589 flow [2022-12-13 04:19:33,123 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 1085 transitions, 156589 flow [2022-12-13 04:19:33,123 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:19:33,125 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:19:33,125 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-13 04:19:33,126 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 1085 transitions, 156589 flow [2022-12-13 04:19:33,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:33,126 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:19:33,126 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] [2022-12-13 04:19:33,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-13 04:19:33,126 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:19:33,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:19:33,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1818924100, now seen corresponding path program 3 times [2022-12-13 04:19:33,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:19:33,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130861560] [2022-12-13 04:19:33,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:19:33,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:19:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:19:33,670 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:19:33,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:19:33,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130861560] [2022-12-13 04:19:33,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130861560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:19:33,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:19:33,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:19:33,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646900705] [2022-12-13 04:19:33,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:19:33,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:19:33,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:19:33,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:19:33,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:19:33,671 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:19:33,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 1085 transitions, 156589 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:33,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:19:33,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:19:33,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:19:36,936 INFO L130 PetriNetUnfolder]: 1997/3800 cut-off events. [2022-12-13 04:19:36,936 INFO L131 PetriNetUnfolder]: For 7706/7706 co-relation queries the response was YES. [2022-12-13 04:19:36,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276987 conditions, 3800 events. 1997/3800 cut-off events. For 7706/7706 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 23996 event pairs, 44 based on Foata normal form. 4/3802 useless extension candidates. Maximal degree in co-relation 192740. Up to 3801 conditions per place. [2022-12-13 04:19:37,012 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 904 selfloop transitions, 37 changer transitions 181/1122 dead transitions. [2022-12-13 04:19:37,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 1122 transitions, 164170 flow [2022-12-13 04:19:37,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 04:19:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 04:19:37,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 170 transitions. [2022-12-13 04:19:37,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2022-12-13 04:19:37,013 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 255 predicate places. [2022-12-13 04:19:37,013 INFO L82 GeneralOperation]: Start removeDead. Operand has 296 places, 1122 transitions, 164170 flow [2022-12-13 04:19:37,101 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 284 places, 941 transitions, 137749 flow [2022-12-13 04:19:37,170 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:19:37,170 INFO L89 Accepts]: Start accepts. Operand has 284 places, 941 transitions, 137749 flow [2022-12-13 04:19:37,226 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:19:37,227 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:19:37,227 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 284 places, 941 transitions, 137749 flow [2022-12-13 04:19:37,259 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 284 places, 941 transitions, 137749 flow [2022-12-13 04:19:37,259 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:19:37,261 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:19:37,261 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 04:19:37,261 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 941 transitions, 137749 flow [2022-12-13 04:19:37,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:37,262 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:19:37,262 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] [2022-12-13 04:19:37,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-13 04:19:37,262 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:19:37,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:19:37,262 INFO L85 PathProgramCache]: Analyzing trace with hash -429403582, now seen corresponding path program 4 times [2022-12-13 04:19:37,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:19:37,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11066001] [2022-12-13 04:19:37,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:19:37,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:19:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:19:37,958 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:19:37,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:19:37,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11066001] [2022-12-13 04:19:37,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11066001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:19:37,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:19:37,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:19:37,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974816738] [2022-12-13 04:19:37,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:19:37,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:19:37,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:19:37,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:19:37,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:19:37,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:19:37,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 941 transitions, 137749 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:37,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:19:37,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:19:37,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:19:40,836 INFO L130 PetriNetUnfolder]: 1716/3255 cut-off events. [2022-12-13 04:19:40,836 INFO L131 PetriNetUnfolder]: For 6154/6154 co-relation queries the response was YES. [2022-12-13 04:19:40,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240675 conditions, 3255 events. 1716/3255 cut-off events. For 6154/6154 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 19706 event pairs, 36 based on Foata normal form. 2/3255 useless extension candidates. Maximal degree in co-relation 181541. Up to 3256 conditions per place. [2022-12-13 04:19:40,897 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 919 selfloop transitions, 58 changer transitions 24/1001 dead transitions. [2022-12-13 04:19:40,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 1001 transitions, 148562 flow [2022-12-13 04:19:40,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:19:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:19:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 142 transitions. [2022-12-13 04:19:40,898 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3287037037037037 [2022-12-13 04:19:40,898 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 254 predicate places. [2022-12-13 04:19:40,898 INFO L82 GeneralOperation]: Start removeDead. Operand has 295 places, 1001 transitions, 148562 flow [2022-12-13 04:19:41,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 294 places, 977 transitions, 144992 flow [2022-12-13 04:19:41,148 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:19:41,148 INFO L89 Accepts]: Start accepts. Operand has 294 places, 977 transitions, 144992 flow [2022-12-13 04:19:41,196 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:19:41,196 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:19:41,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 294 places, 977 transitions, 144992 flow [2022-12-13 04:19:41,232 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 294 places, 977 transitions, 144992 flow [2022-12-13 04:19:41,233 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:19:41,234 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:19:41,235 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-13 04:19:41,235 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 977 transitions, 144992 flow [2022-12-13 04:19:41,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:41,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:19:41,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] [2022-12-13 04:19:41,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-13 04:19:41,235 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:19:41,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:19:41,235 INFO L85 PathProgramCache]: Analyzing trace with hash -327471412, now seen corresponding path program 5 times [2022-12-13 04:19:41,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:19:41,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027971263] [2022-12-13 04:19:41,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:19:41,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:19:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:19:41,699 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:19:41,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:19:41,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027971263] [2022-12-13 04:19:41,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027971263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:19:41,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:19:41,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:19:41,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960318357] [2022-12-13 04:19:41,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:19:41,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:19:41,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:19:41,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:19:41,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:19:41,701 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:19:41,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 977 transitions, 144992 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:41,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:19:41,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:19:41,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:19:44,515 INFO L130 PetriNetUnfolder]: 1708/3219 cut-off events. [2022-12-13 04:19:44,516 INFO L131 PetriNetUnfolder]: For 6094/6094 co-relation queries the response was YES. [2022-12-13 04:19:44,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241225 conditions, 3219 events. 1708/3219 cut-off events. For 6094/6094 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 19345 event pairs, 36 based on Foata normal form. 2/3219 useless extension candidates. Maximal degree in co-relation 183998. Up to 3220 conditions per place. [2022-12-13 04:19:44,580 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 865 selfloop transitions, 46 changer transitions 64/975 dead transitions. [2022-12-13 04:19:44,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 975 transitions, 146646 flow [2022-12-13 04:19:44,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:19:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:19:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2022-12-13 04:19:44,581 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3638888888888889 [2022-12-13 04:19:44,583 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 262 predicate places. [2022-12-13 04:19:44,583 INFO L82 GeneralOperation]: Start removeDead. Operand has 303 places, 975 transitions, 146646 flow [2022-12-13 04:19:44,788 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 911 transitions, 137026 flow [2022-12-13 04:19:44,842 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:19:44,843 INFO L89 Accepts]: Start accepts. Operand has 295 places, 911 transitions, 137026 flow [2022-12-13 04:19:44,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:19:44,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:19:44,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 295 places, 911 transitions, 137026 flow [2022-12-13 04:19:44,917 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 295 places, 911 transitions, 137026 flow [2022-12-13 04:19:44,917 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:19:44,919 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:19:44,919 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-13 04:19:44,919 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 911 transitions, 137026 flow [2022-12-13 04:19:44,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:44,919 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:19:44,920 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] [2022-12-13 04:19:44,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-13 04:19:44,920 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:19:44,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:19:44,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1469094898, now seen corresponding path program 6 times [2022-12-13 04:19:44,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:19:44,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788961981] [2022-12-13 04:19:44,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:19:44,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:19:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:19:45,632 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:19:45,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:19:45,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788961981] [2022-12-13 04:19:45,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788961981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:19:45,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:19:45,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:19:45,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482937980] [2022-12-13 04:19:45,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:19:45,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:19:45,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:19:45,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:19:45,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:19:45,634 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:19:45,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 911 transitions, 137026 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:45,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:19:45,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:19:45,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:19:48,214 INFO L130 PetriNetUnfolder]: 1662/3109 cut-off events. [2022-12-13 04:19:48,214 INFO L131 PetriNetUnfolder]: For 5898/5898 co-relation queries the response was YES. [2022-12-13 04:19:48,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236087 conditions, 3109 events. 1662/3109 cut-off events. For 5898/5898 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 18473 event pairs, 36 based on Foata normal form. 2/3109 useless extension candidates. Maximal degree in co-relation 186455. Up to 3110 conditions per place. [2022-12-13 04:19:48,272 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 739 selfloop transitions, 24 changer transitions 148/911 dead transitions. [2022-12-13 04:19:48,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 911 transitions, 138848 flow [2022-12-13 04:19:48,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:19:48,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:19:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2022-12-13 04:19:48,273 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-13 04:19:48,273 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 264 predicate places. [2022-12-13 04:19:48,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 305 places, 911 transitions, 138848 flow [2022-12-13 04:19:48,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 763 transitions, 116323 flow [2022-12-13 04:19:48,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:19:48,519 INFO L89 Accepts]: Start accepts. Operand has 266 places, 763 transitions, 116323 flow [2022-12-13 04:19:48,550 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:19:48,550 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:19:48,550 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 763 transitions, 116323 flow [2022-12-13 04:19:48,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 763 transitions, 116323 flow [2022-12-13 04:19:48,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:19:50,588 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:19:50,588 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2070 [2022-12-13 04:19:50,589 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 762 transitions, 116171 flow [2022-12-13 04:19:50,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:50,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:19:50,589 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] [2022-12-13 04:19:50,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-13 04:19:50,589 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:19:50,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:19:50,589 INFO L85 PathProgramCache]: Analyzing trace with hash -6592317, now seen corresponding path program 1 times [2022-12-13 04:19:50,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:19:50,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029821466] [2022-12-13 04:19:50,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:19:50,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:19:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:19:51,161 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:19:51,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:19:51,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029821466] [2022-12-13 04:19:51,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029821466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:19:51,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:19:51,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:19:51,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798445841] [2022-12-13 04:19:51,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:19:51,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:19:51,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:19:51,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:19:51,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:19:51,162 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:19:51,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 762 transitions, 116171 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:51,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:19:51,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:19:51,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:19:55,771 INFO L130 PetriNetUnfolder]: 3409/6338 cut-off events. [2022-12-13 04:19:55,771 INFO L131 PetriNetUnfolder]: For 12729/12729 co-relation queries the response was YES. [2022-12-13 04:19:55,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487593 conditions, 6338 events. 3409/6338 cut-off events. For 12729/12729 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 43390 event pairs, 104 based on Foata normal form. 4/6340 useless extension candidates. Maximal degree in co-relation 239066. Up to 6339 conditions per place. [2022-12-13 04:19:55,882 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 1580 selfloop transitions, 112 changer transitions 96/1788 dead transitions. [2022-12-13 04:19:55,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 1788 transitions, 276269 flow [2022-12-13 04:19:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:19:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:19:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 163 transitions. [2022-12-13 04:19:55,883 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4116161616161616 [2022-12-13 04:19:55,883 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 214 predicate places. [2022-12-13 04:19:55,883 INFO L82 GeneralOperation]: Start removeDead. Operand has 255 places, 1788 transitions, 276269 flow [2022-12-13 04:19:56,081 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 254 places, 1692 transitions, 261377 flow [2022-12-13 04:19:56,192 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:19:56,192 INFO L89 Accepts]: Start accepts. Operand has 254 places, 1692 transitions, 261377 flow [2022-12-13 04:19:56,285 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:19:56,285 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:19:56,285 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 254 places, 1692 transitions, 261377 flow [2022-12-13 04:19:56,349 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 254 places, 1692 transitions, 261377 flow [2022-12-13 04:19:56,349 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:19:56,352 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:19:56,353 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 04:19:56,353 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 1692 transitions, 261377 flow [2022-12-13 04:19:56,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:56,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:19:56,353 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] [2022-12-13 04:19:56,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-13 04:19:56,353 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:19:56,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:19:56,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1613726151, now seen corresponding path program 2 times [2022-12-13 04:19:56,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:19:56,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42529772] [2022-12-13 04:19:56,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:19:56,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:19:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:19:57,036 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:19:57,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:19:57,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42529772] [2022-12-13 04:19:57,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42529772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:19:57,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:19:57,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:19:57,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160617516] [2022-12-13 04:19:57,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:19:57,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:19:57,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:19:57,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:19:57,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:19:57,037 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:19:57,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 1692 transitions, 261377 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:57,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:19:57,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:19:57,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:20:05,050 INFO L130 PetriNetUnfolder]: 3269/6206 cut-off events. [2022-12-13 04:20:05,050 INFO L131 PetriNetUnfolder]: For 12815/12815 co-relation queries the response was YES. [2022-12-13 04:20:05,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483600 conditions, 6206 events. 3269/6206 cut-off events. For 12815/12815 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 43362 event pairs, 106 based on Foata normal form. 4/6208 useless extension candidates. Maximal degree in co-relation 233094. Up to 6207 conditions per place. [2022-12-13 04:20:05,161 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 1481 selfloop transitions, 123 changer transitions 148/1752 dead transitions. [2022-12-13 04:20:05,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 1752 transitions, 274181 flow [2022-12-13 04:20:05,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 04:20:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 04:20:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2022-12-13 04:20:05,162 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3782051282051282 [2022-12-13 04:20:05,163 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 225 predicate places. [2022-12-13 04:20:05,163 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 1752 transitions, 274181 flow [2022-12-13 04:20:05,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 264 places, 1604 transitions, 250907 flow [2022-12-13 04:20:05,546 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:20:05,546 INFO L89 Accepts]: Start accepts. Operand has 264 places, 1604 transitions, 250907 flow [2022-12-13 04:20:05,622 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:20:05,623 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:20:05,623 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 264 places, 1604 transitions, 250907 flow [2022-12-13 04:20:05,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 264 places, 1604 transitions, 250907 flow [2022-12-13 04:20:05,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:20:05,685 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:20:05,712 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:20:05,750 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:20:05,767 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:20:05,798 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:20:05,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 253 [2022-12-13 04:20:05,799 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 1603 transitions, 250773 flow [2022-12-13 04:20:05,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:20:05,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:20:05,799 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] [2022-12-13 04:20:05,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-13 04:20:05,799 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:20:05,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:20:05,800 INFO L85 PathProgramCache]: Analyzing trace with hash -506455927, now seen corresponding path program 3 times [2022-12-13 04:20:05,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:20:05,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106709607] [2022-12-13 04:20:05,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:20:05,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:20:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:20:06,385 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:20:06,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:20:06,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106709607] [2022-12-13 04:20:06,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106709607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:20:06,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:20:06,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:20:06,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117816964] [2022-12-13 04:20:06,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:20:06,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:20:06,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:20:06,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:20:06,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:20:06,387 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 04:20:06,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 1603 transitions, 250773 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:20:06,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:20:06,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 04:20:06,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:20:14,513 INFO L130 PetriNetUnfolder]: 3162/6061 cut-off events. [2022-12-13 04:20:14,513 INFO L131 PetriNetUnfolder]: For 10141/10141 co-relation queries the response was YES. [2022-12-13 04:20:14,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478356 conditions, 6061 events. 3162/6061 cut-off events. For 10141/10141 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 42844 event pairs, 66 based on Foata normal form. 4/6063 useless extension candidates. Maximal degree in co-relation 215753. Up to 6062 conditions per place. [2022-12-13 04:20:14,620 INFO L137 encePairwiseOnDemand]: 26/44 looper letters, 1375 selfloop transitions, 85 changer transitions 239/1699 dead transitions. [2022-12-13 04:20:14,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 1699 transitions, 269211 flow [2022-12-13 04:20:14,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:20:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:20:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2022-12-13 04:20:14,635 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33264462809917356 [2022-12-13 04:20:14,636 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 231 predicate places. [2022-12-13 04:20:14,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 1699 transitions, 269211 flow [2022-12-13 04:20:14,787 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 268 places, 1460 transitions, 231310 flow [2022-12-13 04:20:15,020 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:20:15,021 INFO L89 Accepts]: Start accepts. Operand has 268 places, 1460 transitions, 231310 flow [2022-12-13 04:20:15,091 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:20:15,092 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:20:15,092 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 268 places, 1460 transitions, 231310 flow [2022-12-13 04:20:15,156 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 268 places, 1460 transitions, 231310 flow [2022-12-13 04:20:15,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:20:15,159 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:20:15,172 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-13 04:20:15,172 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 1460 transitions, 231310 flow [2022-12-13 04:20:15,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:20:15,172 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:20:15,172 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] [2022-12-13 04:20:15,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-13 04:20:15,172 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:20:15,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:20:15,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1501489727, now seen corresponding path program 1 times [2022-12-13 04:20:15,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:20:15,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142787101] [2022-12-13 04:20:15,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:20:15,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:20:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:20:15,893 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:20:15,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:20:15,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142787101] [2022-12-13 04:20:15,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142787101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:20:15,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:20:15,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:20:15,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214732328] [2022-12-13 04:20:15,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:20:15,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:20:15,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:20:15,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:20:15,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:20:15,894 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 04:20:15,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 1460 transitions, 231310 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:20:15,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:20:15,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 04:20:15,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:20:23,974 INFO L130 PetriNetUnfolder]: 2888/5687 cut-off events. [2022-12-13 04:20:23,974 INFO L131 PetriNetUnfolder]: For 8915/8915 co-relation queries the response was YES. [2022-12-13 04:20:23,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454515 conditions, 5687 events. 2888/5687 cut-off events. For 8915/8915 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 40865 event pairs, 62 based on Foata normal form. 4/5689 useless extension candidates. Maximal degree in co-relation 196283. Up to 5688 conditions per place. [2022-12-13 04:20:24,073 INFO L137 encePairwiseOnDemand]: 28/44 looper letters, 1374 selfloop transitions, 66 changer transitions 120/1560 dead transitions. [2022-12-13 04:20:24,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 1560 transitions, 250338 flow [2022-12-13 04:20:24,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:20:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:20:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2022-12-13 04:20:24,074 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4292929292929293 [2022-12-13 04:20:24,075 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 235 predicate places. [2022-12-13 04:20:24,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 1560 transitions, 250338 flow [2022-12-13 04:20:24,216 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 273 places, 1440 transitions, 231030 flow [2022-12-13 04:20:24,425 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:20:24,425 INFO L89 Accepts]: Start accepts. Operand has 273 places, 1440 transitions, 231030 flow [2022-12-13 04:20:24,489 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:20:24,490 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:20:24,490 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 273 places, 1440 transitions, 231030 flow [2022-12-13 04:20:24,545 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 273 places, 1440 transitions, 231030 flow [2022-12-13 04:20:24,545 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:20:24,548 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:20:24,548 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 04:20:24,548 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 1440 transitions, 231030 flow [2022-12-13 04:20:24,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:20:24,548 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:20:24,548 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] [2022-12-13 04:20:24,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-13 04:20:24,549 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:20:24,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:20:24,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1326638795, now seen corresponding path program 1 times [2022-12-13 04:20:24,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:20:24,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942055272] [2022-12-13 04:20:24,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:20:24,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:20:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:20:25,308 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:20:25,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:20:25,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942055272] [2022-12-13 04:20:25,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942055272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:20:25,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:20:25,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:20:25,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482155070] [2022-12-13 04:20:25,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:20:25,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:20:25,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:20:25,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:20:25,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:20:25,309 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 04:20:25,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 1440 transitions, 231030 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:20:25,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:20:25,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 04:20:25,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:20:32,730 INFO L130 PetriNetUnfolder]: 2834/5551 cut-off events. [2022-12-13 04:20:32,730 INFO L131 PetriNetUnfolder]: For 8907/8907 co-relation queries the response was YES. [2022-12-13 04:20:32,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449167 conditions, 5551 events. 2834/5551 cut-off events. For 8907/8907 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 39383 event pairs, 76 based on Foata normal form. 4/5553 useless extension candidates. Maximal degree in co-relation 198740. Up to 5552 conditions per place. [2022-12-13 04:20:32,828 INFO L137 encePairwiseOnDemand]: 23/40 looper letters, 1361 selfloop transitions, 63 changer transitions 108/1532 dead transitions. [2022-12-13 04:20:32,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 1532 transitions, 248916 flow [2022-12-13 04:20:32,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:20:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:20:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2022-12-13 04:20:32,829 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-13 04:20:32,829 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 241 predicate places. [2022-12-13 04:20:32,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 282 places, 1532 transitions, 248916 flow [2022-12-13 04:20:32,970 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 281 places, 1424 transitions, 231312 flow [2022-12-13 04:20:33,072 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:20:33,072 INFO L89 Accepts]: Start accepts. Operand has 281 places, 1424 transitions, 231312 flow [2022-12-13 04:20:33,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:20:33,193 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:20:33,194 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 281 places, 1424 transitions, 231312 flow [2022-12-13 04:20:33,253 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 281 places, 1424 transitions, 231312 flow [2022-12-13 04:20:33,254 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:20:33,256 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:20:33,257 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-13 04:20:33,257 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 1424 transitions, 231312 flow [2022-12-13 04:20:33,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:20:33,257 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:20:33,257 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] [2022-12-13 04:20:33,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-12-13 04:20:33,257 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:20:33,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:20:33,257 INFO L85 PathProgramCache]: Analyzing trace with hash -757316581, now seen corresponding path program 2 times [2022-12-13 04:20:33,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:20:33,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484914849] [2022-12-13 04:20:33,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:20:33,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:20:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:20:33,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:20:33,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:20:33,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484914849] [2022-12-13 04:20:33,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484914849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:20:33,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:20:33,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:20:33,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674807943] [2022-12-13 04:20:33,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:20:33,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:20:33,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:20:33,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:20:33,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:20:33,956 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 04:20:33,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 1424 transitions, 231312 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:20:33,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:20:33,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 04:20:33,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:20:41,153 INFO L130 PetriNetUnfolder]: 2684/5253 cut-off events. [2022-12-13 04:20:41,154 INFO L131 PetriNetUnfolder]: For 8810/8810 co-relation queries the response was YES. [2022-12-13 04:20:41,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430221 conditions, 5253 events. 2684/5253 cut-off events. For 8810/8810 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 36692 event pairs, 72 based on Foata normal form. 4/5255 useless extension candidates. Maximal degree in co-relation 201197. Up to 5254 conditions per place. [2022-12-13 04:20:41,245 INFO L137 encePairwiseOnDemand]: 23/40 looper letters, 1104 selfloop transitions, 66 changer transitions 307/1477 dead transitions. [2022-12-13 04:20:41,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 1477 transitions, 242909 flow [2022-12-13 04:20:41,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:20:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:20:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 156 transitions. [2022-12-13 04:20:41,246 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.325 [2022-12-13 04:20:41,246 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 251 predicate places. [2022-12-13 04:20:41,246 INFO L82 GeneralOperation]: Start removeDead. Operand has 292 places, 1477 transitions, 242909 flow [2022-12-13 04:20:41,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 288 places, 1170 transitions, 192390 flow [2022-12-13 04:20:41,534 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:20:41,535 INFO L89 Accepts]: Start accepts. Operand has 288 places, 1170 transitions, 192390 flow [2022-12-13 04:20:41,585 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:20:41,585 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:20:41,585 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 288 places, 1170 transitions, 192390 flow [2022-12-13 04:20:41,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 288 places, 1170 transitions, 192390 flow [2022-12-13 04:20:41,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:20:41,685 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [748] L65-->L71: Formula: (and (= (select (select |v_#memory_int_320| v_~f~0.base_165) (+ v_~f~0.offset_165 (* v_~i1~0_105 4))) v_~i~0_310) (= v_~i1~0_105 v_~i~0_311)) InVars {~i~0=v_~i~0_311, ~f~0.base=v_~f~0.base_165, #memory_int=|v_#memory_int_320|, ~f~0.offset=v_~f~0.offset_165} OutVars{~i~0=v_~i~0_310, ~f~0.base=v_~f~0.base_165, #memory_int=|v_#memory_int_320|, ~i1~0=v_~i1~0_105, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_39|, ~f~0.offset=v_~f~0.offset_165} AuxVars[] AssignedVars[~i~0, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 04:20:41,714 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:20:41,715 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-13 04:20:41,715 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 1168 transitions, 192078 flow [2022-12-13 04:20:41,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:20:41,715 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:20:41,715 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] [2022-12-13 04:20:41,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-13 04:20:41,715 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:20:41,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:20:41,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2034619908, now seen corresponding path program 1 times [2022-12-13 04:20:41,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:20:41,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779190079] [2022-12-13 04:20:41,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:20:41,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:20:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:20:42,316 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:20:42,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:20:42,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779190079] [2022-12-13 04:20:42,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779190079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:20:42,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:20:42,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:20:42,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899071791] [2022-12-13 04:20:42,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:20:42,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:20:42,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:20:42,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:20:42,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:20:42,320 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:20:42,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 1168 transitions, 192078 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:20:42,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:20:42,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:20:42,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:20:46,925 INFO L130 PetriNetUnfolder]: 2188/4102 cut-off events. [2022-12-13 04:20:46,925 INFO L131 PetriNetUnfolder]: For 7995/7995 co-relation queries the response was YES. [2022-12-13 04:20:46,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340214 conditions, 4102 events. 2188/4102 cut-off events. For 7995/7995 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 25820 event pairs, 48 based on Foata normal form. 2/4102 useless extension candidates. Maximal degree in co-relation 203654. Up to 4103 conditions per place. [2022-12-13 04:20:46,998 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 1071 selfloop transitions, 68 changer transitions 42/1181 dead transitions. [2022-12-13 04:20:46,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 1181 transitions, 196581 flow [2022-12-13 04:20:46,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:20:46,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:20:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 152 transitions. [2022-12-13 04:20:46,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 04:20:47,000 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 250 predicate places. [2022-12-13 04:20:47,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 291 places, 1181 transitions, 196581 flow [2022-12-13 04:20:47,107 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 290 places, 1139 transitions, 189561 flow [2022-12-13 04:20:47,185 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:20:47,185 INFO L89 Accepts]: Start accepts. Operand has 290 places, 1139 transitions, 189561 flow [2022-12-13 04:20:47,258 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:20:47,259 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:20:47,259 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 290 places, 1139 transitions, 189561 flow [2022-12-13 04:20:47,303 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 290 places, 1139 transitions, 189561 flow [2022-12-13 04:20:47,303 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:20:47,305 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:20:47,305 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 04:20:47,305 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 1139 transitions, 189561 flow [2022-12-13 04:20:47,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:20:47,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:20:47,305 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] [2022-12-13 04:20:47,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-13 04:20:47,305 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:20:47,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:20:47,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1229802806, now seen corresponding path program 1 times [2022-12-13 04:20:47,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:20:47,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349253508] [2022-12-13 04:20:47,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:20:47,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:20:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:20:48,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:20:48,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:20:48,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349253508] [2022-12-13 04:20:48,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349253508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:20:48,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:20:48,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:20:48,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409080972] [2022-12-13 04:20:48,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:20:48,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:20:48,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:20:48,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:20:48,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:20:48,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:20:48,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 1139 transitions, 189561 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:20:48,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:20:48,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:20:48,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:20:53,049 INFO L130 PetriNetUnfolder]: 2218/4206 cut-off events. [2022-12-13 04:20:53,049 INFO L131 PetriNetUnfolder]: For 8464/8464 co-relation queries the response was YES. [2022-12-13 04:20:53,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353069 conditions, 4206 events. 2218/4206 cut-off events. For 8464/8464 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 26906 event pairs, 38 based on Foata normal form. 2/4206 useless extension candidates. Maximal degree in co-relation 206111. Up to 4207 conditions per place. [2022-12-13 04:20:53,133 INFO L137 encePairwiseOnDemand]: 26/38 looper letters, 1163 selfloop transitions, 54 changer transitions 26/1243 dead transitions. [2022-12-13 04:20:53,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 1243 transitions, 209413 flow [2022-12-13 04:20:53,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:20:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:20:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2022-12-13 04:20:53,135 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3827751196172249 [2022-12-13 04:20:53,135 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 259 predicate places. [2022-12-13 04:20:53,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 300 places, 1243 transitions, 209413 flow [2022-12-13 04:20:53,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 299 places, 1217 transitions, 205021 flow [2022-12-13 04:20:53,447 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:20:53,448 INFO L89 Accepts]: Start accepts. Operand has 299 places, 1217 transitions, 205021 flow [2022-12-13 04:20:53,533 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:20:53,534 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:20:53,534 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 1217 transitions, 205021 flow [2022-12-13 04:20:53,584 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 1217 transitions, 205021 flow [2022-12-13 04:20:53,584 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:20:53,589 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:20:53,590 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 04:20:53,590 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 1217 transitions, 205021 flow [2022-12-13 04:20:53,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:20:53,590 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:20:53,590 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] [2022-12-13 04:20:53,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-13 04:20:53,590 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:20:53,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:20:53,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1077659014, now seen corresponding path program 2 times [2022-12-13 04:20:53,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:20:53,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918099290] [2022-12-13 04:20:53,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:20:53,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:20:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:20:53,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:20:53,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:20:53,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918099290] [2022-12-13 04:20:53,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918099290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:20:53,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:20:53,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:20:53,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59451378] [2022-12-13 04:20:53,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:20:53,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:20:53,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:20:53,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:20:53,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:20:53,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:20:53,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 1217 transitions, 205021 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:20:53,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:20:53,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:20:53,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:20:58,380 INFO L130 PetriNetUnfolder]: 2204/4184 cut-off events. [2022-12-13 04:20:58,380 INFO L131 PetriNetUnfolder]: For 8236/8236 co-relation queries the response was YES. [2022-12-13 04:20:58,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355404 conditions, 4184 events. 2204/4184 cut-off events. For 8236/8236 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 26821 event pairs, 38 based on Foata normal form. 2/4184 useless extension candidates. Maximal degree in co-relation 208568. Up to 4185 conditions per place. [2022-12-13 04:20:58,461 INFO L137 encePairwiseOnDemand]: 29/38 looper letters, 1154 selfloop transitions, 31 changer transitions 72/1257 dead transitions. [2022-12-13 04:20:58,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 1257 transitions, 214297 flow [2022-12-13 04:20:58,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:20:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:20:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-12-13 04:20:58,461 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-13 04:20:58,462 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 265 predicate places. [2022-12-13 04:20:58,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 306 places, 1257 transitions, 214297 flow [2022-12-13 04:20:58,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 303 places, 1185 transitions, 202029 flow [2022-12-13 04:20:58,725 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:20:58,725 INFO L89 Accepts]: Start accepts. Operand has 303 places, 1185 transitions, 202029 flow [2022-12-13 04:20:58,806 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:20:58,806 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:20:58,806 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 303 places, 1185 transitions, 202029 flow [2022-12-13 04:20:58,893 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 303 places, 1185 transitions, 202029 flow [2022-12-13 04:20:58,893 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:20:58,895 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:20:58,895 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 04:20:58,895 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 1185 transitions, 202029 flow [2022-12-13 04:20:58,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:20:58,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:20:58,895 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] [2022-12-13 04:20:58,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-13 04:20:58,895 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:20:58,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:20:58,896 INFO L85 PathProgramCache]: Analyzing trace with hash 655416395, now seen corresponding path program 1 times [2022-12-13 04:20:58,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:20:58,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208539804] [2022-12-13 04:20:58,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:20:58,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:20:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:20:59,706 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:20:59,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:20:59,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208539804] [2022-12-13 04:20:59,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208539804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:20:59,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:20:59,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:20:59,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203758055] [2022-12-13 04:20:59,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:20:59,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:20:59,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:20:59,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:20:59,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:20:59,707 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:20:59,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 1185 transitions, 202029 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:20:59,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:20:59,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:20:59,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:21:04,392 INFO L130 PetriNetUnfolder]: 2221/4259 cut-off events. [2022-12-13 04:21:04,392 INFO L131 PetriNetUnfolder]: For 8485/8485 co-relation queries the response was YES. [2022-12-13 04:21:04,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366065 conditions, 4259 events. 2221/4259 cut-off events. For 8485/8485 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 27738 event pairs, 42 based on Foata normal form. 2/4259 useless extension candidates. Maximal degree in co-relation 211025. Up to 4260 conditions per place. [2022-12-13 04:21:04,526 INFO L137 encePairwiseOnDemand]: 25/38 looper letters, 1175 selfloop transitions, 54 changer transitions 85/1314 dead transitions. [2022-12-13 04:21:04,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 1314 transitions, 226664 flow [2022-12-13 04:21:04,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:21:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:21:04,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 153 transitions. [2022-12-13 04:21:04,527 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3355263157894737 [2022-12-13 04:21:04,528 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 273 predicate places. [2022-12-13 04:21:04,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 314 places, 1314 transitions, 226664 flow [2022-12-13 04:21:04,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 313 places, 1229 transitions, 211945 flow [2022-12-13 04:21:04,786 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:21:04,786 INFO L89 Accepts]: Start accepts. Operand has 313 places, 1229 transitions, 211945 flow [2022-12-13 04:21:04,875 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:21:04,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:21:04,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 313 places, 1229 transitions, 211945 flow [2022-12-13 04:21:04,936 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 313 places, 1229 transitions, 211945 flow [2022-12-13 04:21:04,936 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:21:04,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:21:04,989 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:21:05,024 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:21:05,024 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-13 04:21:05,024 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 1227 transitions, 211633 flow [2022-12-13 04:21:05,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:21:05,024 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:21:05,025 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] [2022-12-13 04:21:05,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-12-13 04:21:05,025 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:21:05,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:21:05,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1082611989, now seen corresponding path program 1 times [2022-12-13 04:21:05,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:21:05,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175103784] [2022-12-13 04:21:05,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:21:05,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:21:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:21:05,657 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:21:05,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:21:05,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175103784] [2022-12-13 04:21:05,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175103784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:21:05,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:21:05,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:21:05,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517607494] [2022-12-13 04:21:05,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:21:05,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:21:05,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:21:05,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:21:05,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:21:05,659 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 04:21:05,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 1227 transitions, 211633 flow. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:21:05,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:21:05,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 04:21:05,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:21:10,934 INFO L130 PetriNetUnfolder]: 2149/4122 cut-off events. [2022-12-13 04:21:10,934 INFO L131 PetriNetUnfolder]: For 7276/7276 co-relation queries the response was YES. [2022-12-13 04:21:10,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358465 conditions, 4122 events. 2149/4122 cut-off events. For 7276/7276 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 26757 event pairs, 38 based on Foata normal form. 2/4122 useless extension candidates. Maximal degree in co-relation 213482. Up to 4123 conditions per place. [2022-12-13 04:21:11,011 INFO L137 encePairwiseOnDemand]: 33/44 looper letters, 1177 selfloop transitions, 29 changer transitions 79/1285 dead transitions. [2022-12-13 04:21:11,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 1285 transitions, 224233 flow [2022-12-13 04:21:11,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:21:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:21:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2022-12-13 04:21:11,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2022-12-13 04:21:11,014 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 277 predicate places. [2022-12-13 04:21:11,014 INFO L82 GeneralOperation]: Start removeDead. Operand has 318 places, 1285 transitions, 224233 flow [2022-12-13 04:21:11,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 307 places, 1206 transitions, 210427 flow [2022-12-13 04:21:11,210 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:21:11,210 INFO L89 Accepts]: Start accepts. Operand has 307 places, 1206 transitions, 210427 flow [2022-12-13 04:21:11,300 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:21:11,301 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:21:11,301 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 307 places, 1206 transitions, 210427 flow [2022-12-13 04:21:11,432 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 307 places, 1206 transitions, 210427 flow [2022-12-13 04:21:11,433 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:21:11,436 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:21:11,436 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-13 04:21:11,436 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 1206 transitions, 210427 flow [2022-12-13 04:21:11,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:21:11,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:21:11,436 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] [2022-12-13 04:21:11,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-13 04:21:11,436 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:21:11,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:21:11,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1799005913, now seen corresponding path program 1 times [2022-12-13 04:21:11,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:21:11,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69897646] [2022-12-13 04:21:11,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:21:11,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:21:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:21:12,709 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:21:12,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:21:12,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69897646] [2022-12-13 04:21:12,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69897646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:21:12,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:21:12,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:21:12,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630445813] [2022-12-13 04:21:12,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:21:12,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:21:12,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:21:12,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:21:12,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:21:12,710 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 04:21:12,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 1206 transitions, 210427 flow. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:21:12,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:21:12,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 04:21:12,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:21:17,213 INFO L130 PetriNetUnfolder]: 2087/3959 cut-off events. [2022-12-13 04:21:17,213 INFO L131 PetriNetUnfolder]: For 7219/7219 co-relation queries the response was YES. [2022-12-13 04:21:17,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348210 conditions, 3959 events. 2087/3959 cut-off events. For 7219/7219 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 25107 event pairs, 42 based on Foata normal form. 4/3961 useless extension candidates. Maximal degree in co-relation 215939. Up to 3960 conditions per place. [2022-12-13 04:21:17,385 INFO L137 encePairwiseOnDemand]: 27/41 looper letters, 967 selfloop transitions, 28 changer transitions 207/1202 dead transitions. [2022-12-13 04:21:17,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 1202 transitions, 212135 flow [2022-12-13 04:21:17,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:21:17,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:21:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2022-12-13 04:21:17,386 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3463414634146341 [2022-12-13 04:21:17,386 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 275 predicate places. [2022-12-13 04:21:17,386 INFO L82 GeneralOperation]: Start removeDead. Operand has 316 places, 1202 transitions, 212135 flow [2022-12-13 04:21:17,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 298 places, 995 transitions, 175540 flow [2022-12-13 04:21:17,565 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:21:17,565 INFO L89 Accepts]: Start accepts. Operand has 298 places, 995 transitions, 175540 flow [2022-12-13 04:21:17,622 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:21:17,623 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:21:17,623 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 298 places, 995 transitions, 175540 flow [2022-12-13 04:21:17,665 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 298 places, 995 transitions, 175540 flow [2022-12-13 04:21:17,665 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:21:17,666 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:21:17,667 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 04:21:17,667 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 995 transitions, 175540 flow [2022-12-13 04:21:17,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:21:17,667 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:21:17,667 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] [2022-12-13 04:21:17,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-13 04:21:17,667 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:21:17,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:21:17,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1346079362, now seen corresponding path program 2 times [2022-12-13 04:21:17,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:21:17,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494599318] [2022-12-13 04:21:17,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:21:17,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:21:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:21:18,132 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:21:18,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:21:18,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494599318] [2022-12-13 04:21:18,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494599318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:21:18,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:21:18,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:21:18,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502305033] [2022-12-13 04:21:18,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:21:18,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:21:18,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:21:18,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:21:18,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:21:18,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:21:18,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 995 transitions, 175540 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:21:18,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:21:18,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:21:18,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:21:21,474 INFO L130 PetriNetUnfolder]: 1905/3578 cut-off events. [2022-12-13 04:21:21,474 INFO L131 PetriNetUnfolder]: For 7118/7118 co-relation queries the response was YES. [2022-12-13 04:21:21,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318205 conditions, 3578 events. 1905/3578 cut-off events. For 7118/7118 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 21941 event pairs, 44 based on Foata normal form. 2/3578 useless extension candidates. Maximal degree in co-relation 218396. Up to 3579 conditions per place. [2022-12-13 04:21:21,542 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 882 selfloop transitions, 56 changer transitions 104/1042 dead transitions. [2022-12-13 04:21:21,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 1042 transitions, 185900 flow [2022-12-13 04:21:21,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:21:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:21:21,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-12-13 04:21:21,543 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3712121212121212 [2022-12-13 04:21:21,543 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 267 predicate places. [2022-12-13 04:21:21,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 308 places, 1042 transitions, 185900 flow [2022-12-13 04:21:21,640 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 305 places, 938 transitions, 167327 flow [2022-12-13 04:21:21,711 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:21:21,711 INFO L89 Accepts]: Start accepts. Operand has 305 places, 938 transitions, 167327 flow [2022-12-13 04:21:21,776 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:21:21,776 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:21:21,776 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 305 places, 938 transitions, 167327 flow [2022-12-13 04:21:21,814 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 305 places, 938 transitions, 167327 flow [2022-12-13 04:21:21,814 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:21:21,832 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:21:21,833 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 04:21:21,833 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 937 transitions, 167149 flow [2022-12-13 04:21:21,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:21:21,833 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:21:21,833 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] [2022-12-13 04:21:21,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-12-13 04:21:21,833 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:21:21,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:21:21,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1854074184, now seen corresponding path program 1 times [2022-12-13 04:21:21,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:21:21,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662659638] [2022-12-13 04:21:21,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:21:21,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:21:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:21:22,546 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:21:22,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:21:22,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662659638] [2022-12-13 04:21:22,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662659638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:21:22,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:21:22,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:21:22,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395558898] [2022-12-13 04:21:22,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:21:22,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:21:22,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:21:22,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:21:22,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:21:22,547 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 04:21:22,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 937 transitions, 167149 flow. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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:21:22,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:21:22,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 04:21:22,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:21:25,828 INFO L130 PetriNetUnfolder]: 1716/3254 cut-off events. [2022-12-13 04:21:25,829 INFO L131 PetriNetUnfolder]: For 6156/6156 co-relation queries the response was YES. [2022-12-13 04:21:25,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292681 conditions, 3254 events. 1716/3254 cut-off events. For 6156/6156 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 19709 event pairs, 36 based on Foata normal form. 2/3254 useless extension candidates. Maximal degree in co-relation 220853. Up to 3255 conditions per place. [2022-12-13 04:21:25,900 INFO L137 encePairwiseOnDemand]: 26/37 looper letters, 915 selfloop transitions, 58 changer transitions 22/995 dead transitions. [2022-12-13 04:21:25,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 995 transitions, 179514 flow [2022-12-13 04:21:25,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:21:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:21:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 123 transitions. [2022-12-13 04:21:25,902 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27702702702702703 [2022-12-13 04:21:25,902 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 274 predicate places. [2022-12-13 04:21:25,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 315 places, 995 transitions, 179514 flow [2022-12-13 04:21:26,021 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 314 places, 973 transitions, 175536 flow [2022-12-13 04:21:26,221 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:21:26,221 INFO L89 Accepts]: Start accepts. Operand has 314 places, 973 transitions, 175536 flow [2022-12-13 04:21:26,275 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:21:26,275 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:21:26,275 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 314 places, 973 transitions, 175536 flow [2022-12-13 04:21:26,317 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 314 places, 973 transitions, 175536 flow [2022-12-13 04:21:26,317 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:21:31,513 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:21:31,514 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5293 [2022-12-13 04:21:31,514 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 972 transitions, 175356 flow [2022-12-13 04:21:31,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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:21:31,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:21:31,514 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] [2022-12-13 04:21:31,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-13 04:21:31,514 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:21:31,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:21:31,514 INFO L85 PathProgramCache]: Analyzing trace with hash 722712269, now seen corresponding path program 1 times [2022-12-13 04:21:31,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:21:31,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195174997] [2022-12-13 04:21:31,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:21:31,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:21:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:21:32,257 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:21:32,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:21:32,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195174997] [2022-12-13 04:21:32,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195174997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:21:32,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:21:32,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:21:32,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878358571] [2022-12-13 04:21:32,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:21:32,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:21:32,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:21:32,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:21:32,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:21:32,258 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:21:32,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 972 transitions, 175356 flow. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 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:21:32,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:21:32,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:21:32,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:21:35,412 INFO L130 PetriNetUnfolder]: 1708/3217 cut-off events. [2022-12-13 04:21:35,412 INFO L131 PetriNetUnfolder]: For 6097/6097 co-relation queries the response was YES. [2022-12-13 04:21:35,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292563 conditions, 3217 events. 1708/3217 cut-off events. For 6097/6097 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 19395 event pairs, 36 based on Foata normal form. 2/3217 useless extension candidates. Maximal degree in co-relation 223310. Up to 3218 conditions per place. [2022-12-13 04:21:35,480 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 876 selfloop transitions, 41 changer transitions 58/975 dead transitions. [2022-12-13 04:21:35,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 975 transitions, 177846 flow [2022-12-13 04:21:35,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:21:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:21:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2022-12-13 04:21:35,481 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.284688995215311 [2022-12-13 04:21:35,482 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 282 predicate places. [2022-12-13 04:21:35,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 323 places, 975 transitions, 177846 flow [2022-12-13 04:21:35,578 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 320 places, 917 transitions, 167286 flow [2022-12-13 04:21:35,772 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:21:35,772 INFO L89 Accepts]: Start accepts. Operand has 320 places, 917 transitions, 167286 flow [2022-12-13 04:21:35,823 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:21:35,823 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:21:35,823 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 320 places, 917 transitions, 167286 flow [2022-12-13 04:21:35,873 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 320 places, 917 transitions, 167286 flow [2022-12-13 04:21:35,874 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:21:35,876 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:21:35,876 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 04:21:35,876 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 917 transitions, 167286 flow [2022-12-13 04:21:35,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 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:21:35,876 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:21:35,876 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] [2022-12-13 04:21:35,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-12-13 04:21:35,877 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:21:35,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:21:35,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1039932697, now seen corresponding path program 2 times [2022-12-13 04:21:35,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:21:35,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566092768] [2022-12-13 04:21:35,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:21:35,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:21:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:21:36,644 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:21:36,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:21:36,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566092768] [2022-12-13 04:21:36,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566092768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:21:36,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:21:36,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:21:36,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897227748] [2022-12-13 04:21:36,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:21:36,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:21:36,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:21:36,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:21:36,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:21:36,645 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:21:36,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 917 transitions, 167286 flow. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 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:21:36,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:21:36,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:21:36,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:21:39,535 INFO L130 PetriNetUnfolder]: 1644/3093 cut-off events. [2022-12-13 04:21:39,535 INFO L131 PetriNetUnfolder]: For 6018/6018 co-relation queries the response was YES. [2022-12-13 04:21:39,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284381 conditions, 3093 events. 1644/3093 cut-off events. For 6018/6018 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 18438 event pairs, 36 based on Foata normal form. 2/3093 useless extension candidates. Maximal degree in co-relation 225767. Up to 3094 conditions per place. [2022-12-13 04:21:39,605 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 740 selfloop transitions, 22 changer transitions 153/915 dead transitions. [2022-12-13 04:21:39,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 915 transitions, 168752 flow [2022-12-13 04:21:39,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:21:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:21:39,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2022-12-13 04:21:39,611 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2868421052631579 [2022-12-13 04:21:39,612 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 288 predicate places. [2022-12-13 04:21:39,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 329 places, 915 transitions, 168752 flow [2022-12-13 04:21:39,831 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 278 places, 762 transitions, 140555 flow [2022-12-13 04:21:39,893 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:21:39,893 INFO L89 Accepts]: Start accepts. Operand has 278 places, 762 transitions, 140555 flow [2022-12-13 04:21:39,935 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:21:39,935 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:21:39,935 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 762 transitions, 140555 flow [2022-12-13 04:21:39,964 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 762 transitions, 140555 flow [2022-12-13 04:21:39,964 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:21:39,965 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:21:39,966 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-13 04:21:39,966 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 762 transitions, 140555 flow [2022-12-13 04:21:39,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 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:21:39,966 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:21:39,966 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] [2022-12-13 04:21:39,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-12-13 04:21:39,966 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:21:39,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:21:39,966 INFO L85 PathProgramCache]: Analyzing trace with hash 208414096, now seen corresponding path program 1 times [2022-12-13 04:21:39,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:21:39,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837577785] [2022-12-13 04:21:39,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:21:39,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:21:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:21:40,718 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:21:40,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:21:40,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837577785] [2022-12-13 04:21:40,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837577785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:21:40,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:21:40,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:21:40,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184756444] [2022-12-13 04:21:40,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:21:40,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:21:40,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:21:40,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:21:40,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:21:40,720 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:21:40,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 762 transitions, 140555 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:21:40,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:21:40,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:21:40,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:21:46,074 INFO L130 PetriNetUnfolder]: 3409/6338 cut-off events. [2022-12-13 04:21:46,074 INFO L131 PetriNetUnfolder]: For 12849/12849 co-relation queries the response was YES. [2022-12-13 04:21:46,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589017 conditions, 6338 events. 3409/6338 cut-off events. For 12849/12849 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 43379 event pairs, 86 based on Foata normal form. 4/6340 useless extension candidates. Maximal degree in co-relation 288794. Up to 6339 conditions per place. [2022-12-13 04:21:46,297 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 1580 selfloop transitions, 112 changer transitions 96/1788 dead transitions. [2022-12-13 04:21:46,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 1788 transitions, 333485 flow [2022-12-13 04:21:46,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:21:46,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:21:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions. [2022-12-13 04:21:46,298 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-13 04:21:46,298 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 246 predicate places. [2022-12-13 04:21:46,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 287 places, 1788 transitions, 333485 flow [2022-12-13 04:21:46,567 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 287 places, 1692 transitions, 315521 flow [2022-12-13 04:21:46,719 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:21:46,720 INFO L89 Accepts]: Start accepts. Operand has 287 places, 1692 transitions, 315521 flow [2022-12-13 04:21:46,848 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:21:46,848 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:21:46,848 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 287 places, 1692 transitions, 315521 flow [2022-12-13 04:21:46,921 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 287 places, 1692 transitions, 315521 flow [2022-12-13 04:21:46,921 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:21:46,924 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:21:46,924 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-13 04:21:46,924 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 1692 transitions, 315521 flow [2022-12-13 04:21:46,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:21:46,924 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:21:46,924 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] [2022-12-13 04:21:46,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-13 04:21:46,925 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:21:46,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:21:46,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1398719738, now seen corresponding path program 2 times [2022-12-13 04:21:46,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:21:46,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624132502] [2022-12-13 04:21:46,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:21:46,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:21:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:21:47,701 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:21:47,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:21:47,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624132502] [2022-12-13 04:21:47,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624132502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:21:47,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:21:47,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:21:47,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828719872] [2022-12-13 04:21:47,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:21:47,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:21:47,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:21:47,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:21:47,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:21:47,702 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:21:47,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 1692 transitions, 315521 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:21:47,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:21:47,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:21:47,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:21:58,521 INFO L130 PetriNetUnfolder]: 3269/6206 cut-off events. [2022-12-13 04:21:58,521 INFO L131 PetriNetUnfolder]: For 12680/12680 co-relation queries the response was YES. [2022-12-13 04:21:58,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582912 conditions, 6206 events. 3269/6206 cut-off events. For 12680/12680 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 43408 event pairs, 108 based on Foata normal form. 4/6208 useless extension candidates. Maximal degree in co-relation 280966. Up to 6207 conditions per place. [2022-12-13 04:21:58,657 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 1496 selfloop transitions, 108 changer transitions 148/1752 dead transitions. [2022-12-13 04:21:58,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 1752 transitions, 330245 flow [2022-12-13 04:21:58,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:21:58,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:21:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 159 transitions. [2022-12-13 04:21:58,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2022-12-13 04:21:58,659 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 257 predicate places. [2022-12-13 04:21:58,659 INFO L82 GeneralOperation]: Start removeDead. Operand has 298 places, 1752 transitions, 330245 flow [2022-12-13 04:21:58,937 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 1604 transitions, 302235 flow [2022-12-13 04:21:59,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:21:59,068 INFO L89 Accepts]: Start accepts. Operand has 296 places, 1604 transitions, 302235 flow [2022-12-13 04:21:59,178 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:21:59,179 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:21:59,179 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 296 places, 1604 transitions, 302235 flow [2022-12-13 04:21:59,261 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 296 places, 1604 transitions, 302235 flow [2022-12-13 04:21:59,262 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:21:59,278 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:21:59,310 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:21:59,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:21:59,374 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:21:59,397 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:21:59,397 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 330 [2022-12-13 04:21:59,397 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 1603 transitions, 302069 flow [2022-12-13 04:21:59,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:21:59,397 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:21:59,397 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] [2022-12-13 04:21:59,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-12-13 04:21:59,398 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:21:59,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:21:59,398 INFO L85 PathProgramCache]: Analyzing trace with hash -291449514, now seen corresponding path program 3 times [2022-12-13 04:21:59,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:21:59,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410944727] [2022-12-13 04:21:59,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:21:59,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:21:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:22:00,194 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:22:00,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:22:00,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410944727] [2022-12-13 04:22:00,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410944727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:22:00,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:22:00,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:22:00,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398945917] [2022-12-13 04:22:00,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:22:00,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:22:00,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:22:00,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:22:00,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:22:00,195 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 04:22:00,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 1603 transitions, 302069 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:22:00,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:22:00,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 04:22:00,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:22:09,973 INFO L130 PetriNetUnfolder]: 3162/6061 cut-off events. [2022-12-13 04:22:09,973 INFO L131 PetriNetUnfolder]: For 10142/10142 co-relation queries the response was YES. [2022-12-13 04:22:09,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575348 conditions, 6061 events. 3162/6061 cut-off events. For 10142/10142 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 42793 event pairs, 68 based on Foata normal form. 4/6063 useless extension candidates. Maximal degree in co-relation 259497. Up to 6062 conditions per place. [2022-12-13 04:22:10,093 INFO L137 encePairwiseOnDemand]: 26/44 looper letters, 1375 selfloop transitions, 85 changer transitions 239/1699 dead transitions. [2022-12-13 04:22:10,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 1699 transitions, 323579 flow [2022-12-13 04:22:10,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:22:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:22:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2022-12-13 04:22:10,094 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33264462809917356 [2022-12-13 04:22:10,094 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 263 predicate places. [2022-12-13 04:22:10,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 304 places, 1699 transitions, 323579 flow [2022-12-13 04:22:10,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 300 places, 1460 transitions, 278030 flow [2022-12-13 04:22:10,489 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:22:10,489 INFO L89 Accepts]: Start accepts. Operand has 300 places, 1460 transitions, 278030 flow [2022-12-13 04:22:10,601 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:22:10,601 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:22:10,601 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 300 places, 1460 transitions, 278030 flow [2022-12-13 04:22:10,664 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 300 places, 1460 transitions, 278030 flow [2022-12-13 04:22:10,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:22:10,667 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:22:10,667 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-13 04:22:10,667 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 1460 transitions, 278030 flow [2022-12-13 04:22:10,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:22:10,667 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:22:10,668 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] [2022-12-13 04:22:10,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-12-13 04:22:10,668 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:22:10,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:22:10,668 INFO L85 PathProgramCache]: Analyzing trace with hash -255826701, now seen corresponding path program 1 times [2022-12-13 04:22:10,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:22:10,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624983122] [2022-12-13 04:22:10,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:22:10,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:22:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:22:11,313 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:22:11,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:22:11,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624983122] [2022-12-13 04:22:11,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624983122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:22:11,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:22:11,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:22:11,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639138787] [2022-12-13 04:22:11,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:22:11,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:22:11,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:22:11,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:22:11,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:22:11,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 04:22:11,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 1460 transitions, 278030 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:22:11,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:22:11,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 04:22:11,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:22:19,581 INFO L130 PetriNetUnfolder]: 2846/5611 cut-off events. [2022-12-13 04:22:19,582 INFO L131 PetriNetUnfolder]: For 8883/8883 co-relation queries the response was YES. [2022-12-13 04:22:19,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538207 conditions, 5611 events. 2846/5611 cut-off events. For 8883/8883 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 40240 event pairs, 58 based on Foata normal form. 4/5613 useless extension candidates. Maximal degree in co-relation 235595. Up to 5612 conditions per place. [2022-12-13 04:22:19,696 INFO L137 encePairwiseOnDemand]: 22/44 looper letters, 1370 selfloop transitions, 81 changer transitions 128/1579 dead transitions. [2022-12-13 04:22:19,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 1579 transitions, 303927 flow [2022-12-13 04:22:19,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:22:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:22:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2022-12-13 04:22:19,697 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.378099173553719 [2022-12-13 04:22:19,697 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 269 predicate places. [2022-12-13 04:22:19,697 INFO L82 GeneralOperation]: Start removeDead. Operand has 310 places, 1579 transitions, 303927 flow [2022-12-13 04:22:19,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 307 places, 1451 transitions, 279243 flow [2022-12-13 04:22:20,076 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:22:20,076 INFO L89 Accepts]: Start accepts. Operand has 307 places, 1451 transitions, 279243 flow [2022-12-13 04:22:20,191 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:22:20,191 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:22:20,192 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 307 places, 1451 transitions, 279243 flow [2022-12-13 04:22:20,257 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 307 places, 1451 transitions, 279243 flow [2022-12-13 04:22:20,258 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:22:20,260 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:22:20,260 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-13 04:22:20,260 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 1451 transitions, 279243 flow [2022-12-13 04:22:20,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:22:20,261 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:22:20,261 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] [2022-12-13 04:22:20,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-12-13 04:22:20,261 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:22:20,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:22:20,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1955185219, now seen corresponding path program 2 times [2022-12-13 04:22:20,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:22:20,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445577546] [2022-12-13 04:22:20,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:22:20,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:22:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:22:20,912 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:22:20,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:22:20,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445577546] [2022-12-13 04:22:20,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445577546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:22:20,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:22:20,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:22:20,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772153911] [2022-12-13 04:22:20,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:22:20,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:22:20,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:22:20,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:22:20,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:22:20,913 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 04:22:20,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 1451 transitions, 279243 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:22:20,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:22:20,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 04:22:20,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:22:28,770 INFO L130 PetriNetUnfolder]: 2684/5253 cut-off events. [2022-12-13 04:22:28,771 INFO L131 PetriNetUnfolder]: For 8813/8813 co-relation queries the response was YES. [2022-12-13 04:22:28,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509031 conditions, 5253 events. 2684/5253 cut-off events. For 8813/8813 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 36824 event pairs, 58 based on Foata normal form. 4/5255 useless extension candidates. Maximal degree in co-relation 238052. Up to 5254 conditions per place. [2022-12-13 04:22:28,877 INFO L137 encePairwiseOnDemand]: 22/40 looper letters, 1096 selfloop transitions, 41 changer transitions 334/1471 dead transitions. [2022-12-13 04:22:28,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 1471 transitions, 286049 flow [2022-12-13 04:22:28,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:22:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:22:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 172 transitions. [2022-12-13 04:22:28,878 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2022-12-13 04:22:28,878 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 277 predicate places. [2022-12-13 04:22:28,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 318 places, 1471 transitions, 286049 flow [2022-12-13 04:22:29,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 314 places, 1137 transitions, 221055 flow [2022-12-13 04:22:29,201 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:22:29,201 INFO L89 Accepts]: Start accepts. Operand has 314 places, 1137 transitions, 221055 flow [2022-12-13 04:22:29,264 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:22:29,264 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:22:29,264 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 314 places, 1137 transitions, 221055 flow [2022-12-13 04:22:29,319 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 314 places, 1137 transitions, 221055 flow [2022-12-13 04:22:29,319 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:22:29,371 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] L65-->L71: Formula: (and (= (select (select |v_#memory_int_380| v_~f~0.base_193) (+ v_~f~0.offset_193 (* v_~i1~0_115 4))) v_~i~0_370) (= v_~i1~0_115 v_~i~0_371)) InVars {~i~0=v_~i~0_371, ~f~0.base=v_~f~0.base_193, #memory_int=|v_#memory_int_380|, ~f~0.offset=v_~f~0.offset_193} OutVars{~i~0=v_~i~0_370, ~f~0.base=v_~f~0.base_193, #memory_int=|v_#memory_int_380|, ~i1~0=v_~i1~0_115, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_45|, ~f~0.offset=v_~f~0.offset_193} AuxVars[] AssignedVars[~i~0, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 04:22:29,398 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:22:29,399 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-13 04:22:29,399 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 1135 transitions, 220683 flow [2022-12-13 04:22:29,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:22:29,399 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:22:29,399 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] [2022-12-13 04:22:29,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-12-13 04:22:29,399 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:22:29,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:22:29,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2045340975, now seen corresponding path program 1 times [2022-12-13 04:22:29,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:22:29,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504066764] [2022-12-13 04:22:29,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:22:29,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:22:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:22:30,062 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:22:30,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:22:30,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504066764] [2022-12-13 04:22:30,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504066764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:22:30,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:22:30,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:22:30,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079070138] [2022-12-13 04:22:30,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:22:30,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:22:30,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:22:30,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:22:30,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:22:30,064 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:22:30,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 1135 transitions, 220683 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:22:30,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:22:30,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:22:30,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:22:35,607 INFO L130 PetriNetUnfolder]: 2279/4261 cut-off events. [2022-12-13 04:22:35,607 INFO L131 PetriNetUnfolder]: For 8198/8198 co-relation queries the response was YES. [2022-12-13 04:22:35,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417364 conditions, 4261 events. 2279/4261 cut-off events. For 8198/8198 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 27042 event pairs, 62 based on Foata normal form. 2/4261 useless extension candidates. Maximal degree in co-relation 240509. Up to 4262 conditions per place. [2022-12-13 04:22:35,707 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 1084 selfloop transitions, 77 changer transitions 42/1203 dead transitions. [2022-12-13 04:22:35,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 1203 transitions, 236315 flow [2022-12-13 04:22:35,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:22:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:22:35,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 168 transitions. [2022-12-13 04:22:35,709 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2022-12-13 04:22:35,709 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 275 predicate places. [2022-12-13 04:22:35,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 316 places, 1203 transitions, 236315 flow [2022-12-13 04:22:35,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 316 places, 1161 transitions, 228035 flow [2022-12-13 04:22:36,025 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:22:36,026 INFO L89 Accepts]: Start accepts. Operand has 316 places, 1161 transitions, 228035 flow [2022-12-13 04:22:36,109 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:22:36,109 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:22:36,109 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 316 places, 1161 transitions, 228035 flow [2022-12-13 04:22:36,164 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 316 places, 1161 transitions, 228035 flow [2022-12-13 04:22:36,187 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:22:36,190 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:22:36,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-13 04:22:36,191 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 1161 transitions, 228035 flow [2022-12-13 04:22:36,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:22:36,191 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:22:36,191 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] [2022-12-13 04:22:36,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-12-13 04:22:36,191 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:22:36,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:22:36,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1076002345, now seen corresponding path program 1 times [2022-12-13 04:22:36,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:22:36,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370420998] [2022-12-13 04:22:36,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:22:36,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:22:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:22:37,442 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:22:37,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:22:37,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370420998] [2022-12-13 04:22:37,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370420998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:22:37,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:22:37,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:22:37,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770200428] [2022-12-13 04:22:37,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:22:37,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:22:37,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:22:37,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:22:37,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:22:37,443 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:22:37,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 1161 transitions, 228035 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:22:37,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:22:37,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:22:37,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:22:42,802 INFO L130 PetriNetUnfolder]: 2293/4309 cut-off events. [2022-12-13 04:22:42,802 INFO L131 PetriNetUnfolder]: For 8453/8453 co-relation queries the response was YES. [2022-12-13 04:22:42,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426382 conditions, 4309 events. 2293/4309 cut-off events. For 8453/8453 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 27499 event pairs, 48 based on Foata normal form. 2/4309 useless extension candidates. Maximal degree in co-relation 242966. Up to 4310 conditions per place. [2022-12-13 04:22:43,032 INFO L137 encePairwiseOnDemand]: 26/38 looper letters, 1156 selfloop transitions, 91 changer transitions 46/1293 dead transitions. [2022-12-13 04:22:43,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 1293 transitions, 256625 flow [2022-12-13 04:22:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:22:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:22:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-12-13 04:22:43,033 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4298245614035088 [2022-12-13 04:22:43,033 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 283 predicate places. [2022-12-13 04:22:43,033 INFO L82 GeneralOperation]: Start removeDead. Operand has 324 places, 1293 transitions, 256625 flow [2022-12-13 04:22:43,173 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 324 places, 1247 transitions, 247463 flow [2022-12-13 04:22:43,329 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:22:43,329 INFO L89 Accepts]: Start accepts. Operand has 324 places, 1247 transitions, 247463 flow [2022-12-13 04:22:43,417 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:22:43,417 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:22:43,417 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 324 places, 1247 transitions, 247463 flow [2022-12-13 04:22:43,483 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 324 places, 1247 transitions, 247463 flow [2022-12-13 04:22:43,483 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:22:43,485 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:22:43,486 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-13 04:22:43,486 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 1247 transitions, 247463 flow [2022-12-13 04:22:43,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:22:43,486 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:22:43,486 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] [2022-12-13 04:22:43,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-12-13 04:22:43,486 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:22:43,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:22:43,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1394918521, now seen corresponding path program 2 times [2022-12-13 04:22:43,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:22:43,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660723981] [2022-12-13 04:22:43,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:22:43,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:22:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:22:44,207 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:22:44,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:22:44,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660723981] [2022-12-13 04:22:44,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660723981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:22:44,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:22:44,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:22:44,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836014934] [2022-12-13 04:22:44,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:22:44,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:22:44,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:22:44,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:22:44,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:22:44,208 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:22:44,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 1247 transitions, 247463 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:22:44,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:22:44,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:22:44,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:22:50,239 INFO L130 PetriNetUnfolder]: 2247/4267 cut-off events. [2022-12-13 04:22:50,240 INFO L131 PetriNetUnfolder]: For 8618/8618 co-relation queries the response was YES. [2022-12-13 04:22:50,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426474 conditions, 4267 events. 2247/4267 cut-off events. For 8618/8618 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 27560 event pairs, 46 based on Foata normal form. 2/4267 useless extension candidates. Maximal degree in co-relation 245423. Up to 4268 conditions per place. [2022-12-13 04:22:50,332 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 1175 selfloop transitions, 36 changer transitions 66/1277 dead transitions. [2022-12-13 04:22:50,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1277 transitions, 255987 flow [2022-12-13 04:22:50,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:22:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:22:50,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2022-12-13 04:22:50,333 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39473684210526316 [2022-12-13 04:22:50,333 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 291 predicate places. [2022-12-13 04:22:50,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 1277 transitions, 255987 flow [2022-12-13 04:22:50,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 1211 transitions, 242765 flow [2022-12-13 04:22:50,635 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:22:50,636 INFO L89 Accepts]: Start accepts. Operand has 330 places, 1211 transitions, 242765 flow [2022-12-13 04:22:50,719 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:22:50,720 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:22:50,720 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 330 places, 1211 transitions, 242765 flow [2022-12-13 04:22:50,777 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 330 places, 1211 transitions, 242765 flow [2022-12-13 04:22:50,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:22:50,779 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:22:50,780 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 04:22:50,781 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 1211 transitions, 242765 flow [2022-12-13 04:22:50,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:22:50,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:22:50,781 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] [2022-12-13 04:22:50,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2022-12-13 04:22:50,781 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:22:50,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:22:50,782 INFO L85 PathProgramCache]: Analyzing trace with hash -303959171, now seen corresponding path program 3 times [2022-12-13 04:22:50,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:22:50,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678689246] [2022-12-13 04:22:50,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:22:50,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:22:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:22:51,023 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:22:51,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:22:51,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678689246] [2022-12-13 04:22:51,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678689246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:22:51,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:22:51,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:22:51,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185991088] [2022-12-13 04:22:51,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:22:51,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:22:51,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:22:51,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:22:51,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:22:51,024 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:22:51,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 1211 transitions, 242765 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:22:51,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:22:51,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:22:51,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:22:56,337 INFO L130 PetriNetUnfolder]: 2142/4102 cut-off events. [2022-12-13 04:22:56,337 INFO L131 PetriNetUnfolder]: For 8228/8228 co-relation queries the response was YES. [2022-12-13 04:22:56,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414122 conditions, 4102 events. 2142/4102 cut-off events. For 8228/8228 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 26443 event pairs, 44 based on Foata normal form. 2/4102 useless extension candidates. Maximal degree in co-relation 247880. Up to 4103 conditions per place. [2022-12-13 04:22:56,521 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 1117 selfloop transitions, 36 changer transitions 80/1233 dead transitions. [2022-12-13 04:22:56,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 1233 transitions, 249655 flow [2022-12-13 04:22:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:22:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:22:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2022-12-13 04:22:56,522 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2719298245614035 [2022-12-13 04:22:56,522 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 297 predicate places. [2022-12-13 04:22:56,522 INFO L82 GeneralOperation]: Start removeDead. Operand has 338 places, 1233 transitions, 249655 flow [2022-12-13 04:22:56,657 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 335 places, 1153 transitions, 233411 flow [2022-12-13 04:22:56,800 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:22:56,800 INFO L89 Accepts]: Start accepts. Operand has 335 places, 1153 transitions, 233411 flow [2022-12-13 04:22:56,883 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:22:56,883 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:22:56,883 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 335 places, 1153 transitions, 233411 flow [2022-12-13 04:22:56,946 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 335 places, 1153 transitions, 233411 flow [2022-12-13 04:22:56,947 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:22:56,972 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:22:56,973 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-13 04:22:56,973 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 1152 transitions, 233223 flow [2022-12-13 04:22:56,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:22:56,973 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:22:56,973 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] [2022-12-13 04:22:56,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-12-13 04:22:56,973 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:22:56,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:22:56,974 INFO L85 PathProgramCache]: Analyzing trace with hash 388471111, now seen corresponding path program 1 times [2022-12-13 04:22:56,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:22:56,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768015217] [2022-12-13 04:22:56,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:22:56,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:22:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:22:57,568 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:22:57,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:22:57,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768015217] [2022-12-13 04:22:57,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768015217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:22:57,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:22:57,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:22:57,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180297698] [2022-12-13 04:22:57,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:22:57,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:22:57,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:22:57,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:22:57,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:22:57,569 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 04:22:57,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 1152 transitions, 233223 flow. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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:22:57,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:22:57,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 04:22:57,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:23:03,219 INFO L130 PetriNetUnfolder]: 2091/3987 cut-off events. [2022-12-13 04:23:03,219 INFO L131 PetriNetUnfolder]: For 7394/7394 co-relation queries the response was YES. [2022-12-13 04:23:03,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406552 conditions, 3987 events. 2091/3987 cut-off events. For 7394/7394 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 25361 event pairs, 44 based on Foata normal form. 2/3987 useless extension candidates. Maximal degree in co-relation 250337. Up to 3988 conditions per place. [2022-12-13 04:23:03,310 INFO L137 encePairwiseOnDemand]: 28/40 looper letters, 1113 selfloop transitions, 31 changer transitions 83/1227 dead transitions. [2022-12-13 04:23:03,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 1227 transitions, 250887 flow [2022-12-13 04:23:03,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:23:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:23:03,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-12-13 04:23:03,311 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.409375 [2022-12-13 04:23:03,311 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 299 predicate places. [2022-12-13 04:23:03,311 INFO L82 GeneralOperation]: Start removeDead. Operand has 340 places, 1227 transitions, 250887 flow [2022-12-13 04:23:03,476 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 337 places, 1144 transitions, 233890 flow [2022-12-13 04:23:03,592 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:23:03,592 INFO L89 Accepts]: Start accepts. Operand has 337 places, 1144 transitions, 233890 flow [2022-12-13 04:23:03,755 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:23:03,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:23:03,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 337 places, 1144 transitions, 233890 flow [2022-12-13 04:23:03,910 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 337 places, 1144 transitions, 233890 flow [2022-12-13 04:23:03,911 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:23:03,913 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:23:03,913 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 321 [2022-12-13 04:23:03,913 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 1144 transitions, 233890 flow [2022-12-13 04:23:03,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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:23:03,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:23:03,913 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] [2022-12-13 04:23:03,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-12-13 04:23:03,914 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:23:03,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:23:03,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1686752842, now seen corresponding path program 1 times [2022-12-13 04:23:03,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:23:03,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304888389] [2022-12-13 04:23:03,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:23:03,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:23:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:23:04,637 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:23:04,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:23:04,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304888389] [2022-12-13 04:23:04,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304888389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:23:04,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:23:04,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:23:04,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850854894] [2022-12-13 04:23:04,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:23:04,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:23:04,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:23:04,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:23:04,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:23:04,638 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:23:04,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 1144 transitions, 233890 flow. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:23:04,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:23:04,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:23:04,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:23:10,311 INFO L130 PetriNetUnfolder]: 2026/3830 cut-off events. [2022-12-13 04:23:10,311 INFO L131 PetriNetUnfolder]: For 7354/7354 co-relation queries the response was YES. [2022-12-13 04:23:10,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394332 conditions, 3830 events. 2026/3830 cut-off events. For 7354/7354 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23930 event pairs, 44 based on Foata normal form. 2/3830 useless extension candidates. Maximal degree in co-relation 252794. Up to 3831 conditions per place. [2022-12-13 04:23:10,529 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 1031 selfloop transitions, 28 changer transitions 83/1142 dead transitions. [2022-12-13 04:23:10,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 1142 transitions, 235766 flow [2022-12-13 04:23:10,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:23:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:23:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2022-12-13 04:23:10,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.391025641025641 [2022-12-13 04:23:10,531 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 303 predicate places. [2022-12-13 04:23:10,531 INFO L82 GeneralOperation]: Start removeDead. Operand has 344 places, 1142 transitions, 235766 flow [2022-12-13 04:23:10,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 327 places, 1059 transitions, 218608 flow [2022-12-13 04:23:10,806 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:23:10,806 INFO L89 Accepts]: Start accepts. Operand has 327 places, 1059 transitions, 218608 flow [2022-12-13 04:23:10,962 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:23:10,962 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:23:10,962 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 327 places, 1059 transitions, 218608 flow [2022-12-13 04:23:11,023 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 327 places, 1059 transitions, 218608 flow [2022-12-13 04:23:11,023 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:23:11,025 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:23:11,025 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-13 04:23:11,025 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 1059 transitions, 218608 flow [2022-12-13 04:23:11,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:23:11,025 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:23:11,025 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] [2022-12-13 04:23:11,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2022-12-13 04:23:11,026 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:23:11,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:23:11,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1561085775, now seen corresponding path program 2 times [2022-12-13 04:23:11,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:23:11,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138251366] [2022-12-13 04:23:11,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:23:11,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:23:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:23:12,261 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:23:12,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:23:12,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138251366] [2022-12-13 04:23:12,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138251366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:23:12,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:23:12,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:23:12,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830752527] [2022-12-13 04:23:12,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:23:12,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:23:12,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:23:12,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:23:12,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:23:12,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:23:12,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 1059 transitions, 218608 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:23:12,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:23:12,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:23:12,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:23:17,102 INFO L130 PetriNetUnfolder]: 1996/3737 cut-off events. [2022-12-13 04:23:17,102 INFO L131 PetriNetUnfolder]: For 7389/7389 co-relation queries the response was YES. [2022-12-13 04:23:17,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388449 conditions, 3737 events. 1996/3737 cut-off events. For 7389/7389 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 23073 event pairs, 44 based on Foata normal form. 2/3737 useless extension candidates. Maximal degree in co-relation 255251. Up to 3738 conditions per place. [2022-12-13 04:23:17,209 INFO L137 encePairwiseOnDemand]: 24/36 looper letters, 951 selfloop transitions, 51 changer transitions 104/1106 dead transitions. [2022-12-13 04:23:17,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 1106 transitions, 230506 flow [2022-12-13 04:23:17,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:23:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:23:17,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2022-12-13 04:23:17,210 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2022-12-13 04:23:17,210 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 297 predicate places. [2022-12-13 04:23:17,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 338 places, 1106 transitions, 230506 flow [2022-12-13 04:23:17,363 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 335 places, 1002 transitions, 208813 flow [2022-12-13 04:23:17,492 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:23:17,492 INFO L89 Accepts]: Start accepts. Operand has 335 places, 1002 transitions, 208813 flow [2022-12-13 04:23:17,560 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:23:17,560 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:23:17,561 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 335 places, 1002 transitions, 208813 flow [2022-12-13 04:23:17,611 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 335 places, 1002 transitions, 208813 flow [2022-12-13 04:23:17,612 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:23:17,613 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:23:17,614 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 04:23:17,614 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 1002 transitions, 208813 flow [2022-12-13 04:23:17,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:23:17,614 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:23:17,614 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] [2022-12-13 04:23:17,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2022-12-13 04:23:17,614 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:23:17,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:23:17,614 INFO L85 PathProgramCache]: Analyzing trace with hash 11925371, now seen corresponding path program 3 times [2022-12-13 04:23:17,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:23:17,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099182397] [2022-12-13 04:23:17,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:23:17,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:23:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:23:18,340 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:23:18,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:23:18,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099182397] [2022-12-13 04:23:18,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099182397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:23:18,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:23:18,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:23:18,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311302161] [2022-12-13 04:23:18,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:23:18,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:23:18,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:23:18,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:23:18,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:23:18,342 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:23:18,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 1002 transitions, 208813 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:23:18,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:23:18,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:23:18,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:23:22,609 INFO L130 PetriNetUnfolder]: 1807/3414 cut-off events. [2022-12-13 04:23:22,609 INFO L131 PetriNetUnfolder]: For 6360/6360 co-relation queries the response was YES. [2022-12-13 04:23:22,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358329 conditions, 3414 events. 1807/3414 cut-off events. For 6360/6360 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 20802 event pairs, 36 based on Foata normal form. 2/3414 useless extension candidates. Maximal degree in co-relation 257708. Up to 3415 conditions per place. [2022-12-13 04:23:22,689 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 968 selfloop transitions, 74 changer transitions 24/1066 dead transitions. [2022-12-13 04:23:22,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 1066 transitions, 224314 flow [2022-12-13 04:23:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:23:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:23:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 142 transitions. [2022-12-13 04:23:22,691 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3287037037037037 [2022-12-13 04:23:22,691 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 305 predicate places. [2022-12-13 04:23:22,691 INFO L82 GeneralOperation]: Start removeDead. Operand has 346 places, 1066 transitions, 224314 flow [2022-12-13 04:23:22,813 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 345 places, 1042 transitions, 219256 flow [2022-12-13 04:23:22,891 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:23:22,891 INFO L89 Accepts]: Start accepts. Operand has 345 places, 1042 transitions, 219256 flow [2022-12-13 04:23:22,982 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:23:22,982 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:23:22,982 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 345 places, 1042 transitions, 219256 flow [2022-12-13 04:23:23,132 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 345 places, 1042 transitions, 219256 flow [2022-12-13 04:23:23,132 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:23:23,133 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:23:23,134 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-13 04:23:23,134 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 1042 transitions, 219256 flow [2022-12-13 04:23:23,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:23:23,134 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:23:23,135 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] [2022-12-13 04:23:23,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2022-12-13 04:23:23,135 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:23:23,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:23:23,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1797152409, now seen corresponding path program 4 times [2022-12-13 04:23:23,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:23:23,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243730037] [2022-12-13 04:23:23,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:23:23,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:23:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:23:23,322 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:23:23,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:23:23,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243730037] [2022-12-13 04:23:23,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243730037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:23:23,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:23:23,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:23:23,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735004983] [2022-12-13 04:23:23,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:23:23,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:23:23,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:23:23,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:23:23,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:23:23,351 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:23:23,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 1042 transitions, 219256 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:23:23,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:23:23,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:23:23,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:23:27,170 INFO L130 PetriNetUnfolder]: 1797/3396 cut-off events. [2022-12-13 04:23:27,171 INFO L131 PetriNetUnfolder]: For 6243/6243 co-relation queries the response was YES. [2022-12-13 04:23:27,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359836 conditions, 3396 events. 1797/3396 cut-off events. For 6243/6243 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 20705 event pairs, 36 based on Foata normal form. 6/3400 useless extension candidates. Maximal degree in co-relation 262075. Up to 3397 conditions per place. [2022-12-13 04:23:27,392 INFO L137 encePairwiseOnDemand]: 27/36 looper letters, 809 selfloop transitions, 70 changer transitions 192/1071 dead transitions. [2022-12-13 04:23:27,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 1071 transitions, 227521 flow [2022-12-13 04:23:27,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:23:27,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:23:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-12-13 04:23:27,393 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3298611111111111 [2022-12-13 04:23:27,393 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 311 predicate places. [2022-12-13 04:23:27,393 INFO L82 GeneralOperation]: Start removeDead. Operand has 352 places, 1071 transitions, 227521 flow [2022-12-13 04:23:27,498 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 343 places, 879 transitions, 186691 flow [2022-12-13 04:23:27,576 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:23:27,577 INFO L89 Accepts]: Start accepts. Operand has 343 places, 879 transitions, 186691 flow [2022-12-13 04:23:27,651 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:23:27,651 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:23:27,651 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 343 places, 879 transitions, 186691 flow [2022-12-13 04:23:27,693 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 343 places, 879 transitions, 186691 flow [2022-12-13 04:23:27,694 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:23:27,695 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:23:27,695 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 04:23:27,695 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 879 transitions, 186691 flow [2022-12-13 04:23:27,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:23:27,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:23:27,696 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] [2022-12-13 04:23:27,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2022-12-13 04:23:27,696 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:23:27,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:23:27,696 INFO L85 PathProgramCache]: Analyzing trace with hash 655528923, now seen corresponding path program 5 times [2022-12-13 04:23:27,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:23:27,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780216826] [2022-12-13 04:23:27,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:23:27,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:23:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:23:28,406 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:23:28,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:23:28,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780216826] [2022-12-13 04:23:28,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780216826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:23:28,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:23:28,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:23:28,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110585737] [2022-12-13 04:23:28,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:23:28,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:23:28,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:23:28,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:23:28,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:23:28,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:23:28,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 879 transitions, 186691 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:23:28,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:23:28,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:23:28,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:23:31,327 INFO L130 PetriNetUnfolder]: 1637/3038 cut-off events. [2022-12-13 04:23:31,327 INFO L131 PetriNetUnfolder]: For 5665/5665 co-relation queries the response was YES. [2022-12-13 04:23:31,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324882 conditions, 3038 events. 1637/3038 cut-off events. For 5665/5665 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 17939 event pairs, 36 based on Foata normal form. 2/3038 useless extension candidates. Maximal degree in co-relation 248250. Up to 3039 conditions per place. [2022-12-13 04:23:31,399 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 674 selfloop transitions, 24 changer transitions 184/882 dead transitions. [2022-12-13 04:23:31,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 882 transitions, 189091 flow [2022-12-13 04:23:31,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:23:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:23:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2022-12-13 04:23:31,400 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-13 04:23:31,400 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 312 predicate places. [2022-12-13 04:23:31,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 353 places, 882 transitions, 189091 flow [2022-12-13 04:23:31,498 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 324 places, 698 transitions, 149662 flow [2022-12-13 04:23:31,712 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:23:31,712 INFO L89 Accepts]: Start accepts. Operand has 324 places, 698 transitions, 149662 flow [2022-12-13 04:23:31,755 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:23:31,755 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:23:31,755 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 324 places, 698 transitions, 149662 flow [2022-12-13 04:23:31,788 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 324 places, 698 transitions, 149662 flow [2022-12-13 04:23:31,788 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:23:35,519 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:23:35,520 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3808 [2022-12-13 04:23:35,520 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 697 transitions, 149448 flow [2022-12-13 04:23:35,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:23:35,520 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:23:35,520 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] [2022-12-13 04:23:35,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2022-12-13 04:23:35,520 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:23:35,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:23:35,521 INFO L85 PathProgramCache]: Analyzing trace with hash 378156001, now seen corresponding path program 1 times [2022-12-13 04:23:35,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:23:35,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308577647] [2022-12-13 04:23:35,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:23:35,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:23:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:23:37,352 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:23:37,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:23:37,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308577647] [2022-12-13 04:23:37,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308577647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:23:37,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:23:37,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:23:37,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125313416] [2022-12-13 04:23:37,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:23:37,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 04:23:37,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:23:37,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 04:23:37,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-13 04:23:37,353 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:23:37,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 697 transitions, 149448 flow. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:23:37,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:23:37,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:23:37,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:23:42,366 INFO L130 PetriNetUnfolder]: 3164/5642 cut-off events. [2022-12-13 04:23:42,366 INFO L131 PetriNetUnfolder]: For 11580/11580 co-relation queries the response was YES. [2022-12-13 04:23:42,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608935 conditions, 5642 events. 3164/5642 cut-off events. For 11580/11580 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 36289 event pairs, 78 based on Foata normal form. 4/5644 useless extension candidates. Maximal degree in co-relation 334436. Up to 5643 conditions per place. [2022-12-13 04:23:42,560 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 1252 selfloop transitions, 173 changer transitions 96/1521 dead transitions. [2022-12-13 04:23:42,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 1521 transitions, 329319 flow [2022-12-13 04:23:42,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:23:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:23:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 161 transitions. [2022-12-13 04:23:42,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44722222222222224 [2022-12-13 04:23:42,561 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 279 predicate places. [2022-12-13 04:23:42,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 320 places, 1521 transitions, 329319 flow [2022-12-13 04:23:42,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 320 places, 1425 transitions, 308475 flow [2022-12-13 04:23:42,923 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:23:42,924 INFO L89 Accepts]: Start accepts. Operand has 320 places, 1425 transitions, 308475 flow [2022-12-13 04:23:43,010 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:23:43,010 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:23:43,010 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 320 places, 1425 transitions, 308475 flow [2022-12-13 04:23:43,085 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 320 places, 1425 transitions, 308475 flow [2022-12-13 04:23:43,085 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:23:43,087 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:23:43,088 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-13 04:23:43,088 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 1425 transitions, 308475 flow [2022-12-13 04:23:43,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:23:43,088 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:23:43,088 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] [2022-12-13 04:23:43,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2022-12-13 04:23:43,088 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:23:43,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:23:43,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1228977833, now seen corresponding path program 2 times [2022-12-13 04:23:43,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:23:43,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191614277] [2022-12-13 04:23:43,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:23:43,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:23:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:23:43,758 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:23:43,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:23:43,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191614277] [2022-12-13 04:23:43,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191614277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:23:43,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:23:43,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:23:43,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64954244] [2022-12-13 04:23:43,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:23:43,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:23:43,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:23:43,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:23:43,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:23:43,759 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:23:43,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 1425 transitions, 308475 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:23:43,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:23:43,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:23:43,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:23:54,461 INFO L130 PetriNetUnfolder]: 3601/6770 cut-off events. [2022-12-13 04:23:54,461 INFO L131 PetriNetUnfolder]: For 14016/14016 co-relation queries the response was YES. [2022-12-13 04:23:54,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737470 conditions, 6770 events. 3601/6770 cut-off events. For 14016/14016 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 47837 event pairs, 116 based on Foata normal form. 4/6772 useless extension candidates. Maximal degree in co-relation 395845. Up to 6771 conditions per place. [2022-12-13 04:23:54,620 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 1620 selfloop transitions, 164 changer transitions 156/1940 dead transitions. [2022-12-13 04:23:54,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 1940 transitions, 423934 flow [2022-12-13 04:23:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:23:54,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:23:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 173 transitions. [2022-12-13 04:23:54,621 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40046296296296297 [2022-12-13 04:23:54,621 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 290 predicate places. [2022-12-13 04:23:54,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 1940 transitions, 423934 flow [2022-12-13 04:23:54,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 1784 transitions, 389740 flow [2022-12-13 04:23:55,149 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:23:55,149 INFO L89 Accepts]: Start accepts. Operand has 330 places, 1784 transitions, 389740 flow [2022-12-13 04:23:55,308 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:23:55,309 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:23:55,309 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 330 places, 1784 transitions, 389740 flow [2022-12-13 04:23:55,396 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 330 places, 1784 transitions, 389740 flow [2022-12-13 04:23:55,396 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:23:55,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:23:55,423 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:23:55,453 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:23:55,479 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:23:55,511 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:23:55,512 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 363 [2022-12-13 04:23:55,512 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 1783 transitions, 389544 flow [2022-12-13 04:23:55,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:23:55,512 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:23:55,512 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] [2022-12-13 04:23:55,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2022-12-13 04:23:55,512 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:23:55,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:23:55,512 INFO L85 PathProgramCache]: Analyzing trace with hash -121707609, now seen corresponding path program 3 times [2022-12-13 04:23:55,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:23:55,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368208176] [2022-12-13 04:23:55,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:23:55,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:23:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:23:56,411 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:23:56,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:23:56,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368208176] [2022-12-13 04:23:56,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368208176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:23:56,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:23:56,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:23:56,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177783012] [2022-12-13 04:23:56,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:23:56,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 04:23:56,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:23:56,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 04:23:56,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 04:23:56,412 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 04:23:56,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 1783 transitions, 389544 flow. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:23:56,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:23:56,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 04:23:56,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:24:10,268 INFO L130 PetriNetUnfolder]: 3430/6561 cut-off events. [2022-12-13 04:24:10,269 INFO L131 PetriNetUnfolder]: For 10895/10895 co-relation queries the response was YES. [2022-12-13 04:24:10,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721255 conditions, 6561 events. 3430/6561 cut-off events. For 10895/10895 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 47185 event pairs, 76 based on Foata normal form. 4/6563 useless extension candidates. Maximal degree in co-relation 364108. Up to 6562 conditions per place. [2022-12-13 04:24:10,535 INFO L137 encePairwiseOnDemand]: 25/44 looper letters, 1522 selfloop transitions, 118 changer transitions 257/1897 dead transitions. [2022-12-13 04:24:10,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 1897 transitions, 418254 flow [2022-12-13 04:24:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:24:10,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:24:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 182 transitions. [2022-12-13 04:24:10,536 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3446969696969697 [2022-12-13 04:24:10,536 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 299 predicate places. [2022-12-13 04:24:10,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 340 places, 1897 transitions, 418254 flow [2022-12-13 04:24:10,740 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 336 places, 1640 transitions, 361575 flow [2022-12-13 04:24:10,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:24:10,994 INFO L89 Accepts]: Start accepts. Operand has 336 places, 1640 transitions, 361575 flow [2022-12-13 04:24:11,121 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:24:11,121 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:24:11,121 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 336 places, 1640 transitions, 361575 flow [2022-12-13 04:24:11,203 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 336 places, 1640 transitions, 361575 flow [2022-12-13 04:24:11,203 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:24:11,206 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:24:11,206 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-13 04:24:11,206 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 1640 transitions, 361575 flow [2022-12-13 04:24:11,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:24:11,206 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:24:11,206 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] [2022-12-13 04:24:11,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2022-12-13 04:24:11,207 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:24:11,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:24:11,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1619537285, now seen corresponding path program 1 times [2022-12-13 04:24:11,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:24:11,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605091489] [2022-12-13 04:24:11,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:24:11,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:24:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:24:11,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:24:11,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:24:11,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605091489] [2022-12-13 04:24:11,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605091489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:24:11,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:24:11,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:24:11,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937785155] [2022-12-13 04:24:11,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:24:11,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:24:11,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:24:11,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:24:11,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:24:11,804 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 04:24:11,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 1640 transitions, 361575 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:24:11,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:24:11,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 04:24:11,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:24:23,744 INFO L130 PetriNetUnfolder]: 3142/6173 cut-off events. [2022-12-13 04:24:23,744 INFO L131 PetriNetUnfolder]: For 9737/9737 co-relation queries the response was YES. [2022-12-13 04:24:23,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684766 conditions, 6173 events. 3142/6173 cut-off events. For 9737/9737 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 45166 event pairs, 58 based on Foata normal form. 4/6175 useless extension candidates. Maximal degree in co-relation 322589. Up to 6174 conditions per place. [2022-12-13 04:24:24,006 INFO L137 encePairwiseOnDemand]: 27/44 looper letters, 1533 selfloop transitions, 114 changer transitions 120/1767 dead transitions. [2022-12-13 04:24:24,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 1767 transitions, 393184 flow [2022-12-13 04:24:24,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:24:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:24:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2022-12-13 04:24:24,007 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4113636363636364 [2022-12-13 04:24:24,007 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 304 predicate places. [2022-12-13 04:24:24,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 345 places, 1767 transitions, 393184 flow [2022-12-13 04:24:24,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 343 places, 1647 transitions, 366436 flow [2022-12-13 04:24:24,440 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:24:24,440 INFO L89 Accepts]: Start accepts. Operand has 343 places, 1647 transitions, 366436 flow [2022-12-13 04:24:24,563 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:24:24,563 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:24:24,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 343 places, 1647 transitions, 366436 flow [2022-12-13 04:24:24,653 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 343 places, 1647 transitions, 366436 flow [2022-12-13 04:24:24,654 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:24:24,656 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:24:24,657 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-13 04:24:24,657 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 1647 transitions, 366436 flow [2022-12-13 04:24:24,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:24:24,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:24:24,657 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] [2022-12-13 04:24:24,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2022-12-13 04:24:24,657 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:24:24,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:24:24,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1444686353, now seen corresponding path program 1 times [2022-12-13 04:24:24,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:24:24,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543865245] [2022-12-13 04:24:24,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:24:24,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:24:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:24:24,886 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:24:24,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:24:24,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543865245] [2022-12-13 04:24:24,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543865245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:24:24,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:24:24,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:24:24,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467303098] [2022-12-13 04:24:24,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:24:24,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 04:24:24,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:24:24,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 04:24:24,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-13 04:24:24,887 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 04:24:24,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 1647 transitions, 366436 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 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:24:24,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:24:24,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 04:24:24,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:24:40,842 INFO L130 PetriNetUnfolder]: 3196/6369 cut-off events. [2022-12-13 04:24:40,842 INFO L131 PetriNetUnfolder]: For 10260/10260 co-relation queries the response was YES. [2022-12-13 04:24:40,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712964 conditions, 6369 events. 3196/6369 cut-off events. For 10260/10260 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 47192 event pairs, 66 based on Foata normal form. 24/6391 useless extension candidates. Maximal degree in co-relation 312261. Up to 6370 conditions per place. [2022-12-13 04:24:40,973 INFO L137 encePairwiseOnDemand]: 19/40 looper letters, 1255 selfloop transitions, 138 changer transitions 570/1963 dead transitions. [2022-12-13 04:24:40,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 1963 transitions, 440772 flow [2022-12-13 04:24:40,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 04:24:40,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 04:24:40,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 167 transitions. [2022-12-13 04:24:40,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2982142857142857 [2022-12-13 04:24:40,975 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 315 predicate places. [2022-12-13 04:24:40,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 356 places, 1963 transitions, 440772 flow [2022-12-13 04:24:41,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 352 places, 1393 transitions, 312501 flow [2022-12-13 04:24:41,439 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:24:41,439 INFO L89 Accepts]: Start accepts. Operand has 352 places, 1393 transitions, 312501 flow [2022-12-13 04:24:41,557 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:24:41,557 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:24:41,557 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 352 places, 1393 transitions, 312501 flow [2022-12-13 04:24:41,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 352 places, 1393 transitions, 312501 flow [2022-12-13 04:24:41,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:24:41,643 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:24:41,660 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:24:41,684 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:24:41,685 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 246 [2022-12-13 04:24:41,685 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 1392 transitions, 312295 flow [2022-12-13 04:24:41,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 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:24:41,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:24:41,685 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] [2022-12-13 04:24:41,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2022-12-13 04:24:41,685 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:24:41,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:24:41,685 INFO L85 PathProgramCache]: Analyzing trace with hash -639269023, now seen corresponding path program 2 times [2022-12-13 04:24:41,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:24:41,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420413108] [2022-12-13 04:24:41,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:24:41,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:24:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:24:42,358 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:24:42,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:24:42,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420413108] [2022-12-13 04:24:42,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420413108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:24:42,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:24:42,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:24:42,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047907183] [2022-12-13 04:24:42,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:24:42,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:24:42,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:24:42,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:24:42,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:24:42,359 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 04:24:42,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 1392 transitions, 312295 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:24:42,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:24:42,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 04:24:42,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:24:51,032 INFO L130 PetriNetUnfolder]: 2491/4865 cut-off events. [2022-12-13 04:24:51,032 INFO L131 PetriNetUnfolder]: For 8124/8124 co-relation queries the response was YES. [2022-12-13 04:24:51,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549153 conditions, 4865 events. 2491/4865 cut-off events. For 8124/8124 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 33863 event pairs, 58 based on Foata normal form. 4/4867 useless extension candidates. Maximal degree in co-relation 243220. Up to 4866 conditions per place. [2022-12-13 04:24:51,147 INFO L137 encePairwiseOnDemand]: 22/42 looper letters, 980 selfloop transitions, 45 changer transitions 387/1412 dead transitions. [2022-12-13 04:24:51,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 1412 transitions, 319623 flow [2022-12-13 04:24:51,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:24:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:24:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 174 transitions. [2022-12-13 04:24:51,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34523809523809523 [2022-12-13 04:24:51,149 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 321 predicate places. [2022-12-13 04:24:51,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 362 places, 1412 transitions, 319623 flow [2022-12-13 04:24:51,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 359 places, 1025 transitions, 231972 flow [2022-12-13 04:24:51,507 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:24:51,507 INFO L89 Accepts]: Start accepts. Operand has 359 places, 1025 transitions, 231972 flow [2022-12-13 04:24:51,580 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:24:51,581 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:24:51,581 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 359 places, 1025 transitions, 231972 flow [2022-12-13 04:24:51,641 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 359 places, 1025 transitions, 231972 flow [2022-12-13 04:24:51,641 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:24:51,655 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [784] L65-->L71: Formula: (and (= (select (select |v_#memory_int_430| v_~f~0.base_213) (+ v_~f~0.offset_213 (* v_~i1~0_123 4))) v_~i~0_420) (= v_~i1~0_123 v_~i~0_421)) InVars {~i~0=v_~i~0_421, ~f~0.base=v_~f~0.base_213, #memory_int=|v_#memory_int_430|, ~f~0.offset=v_~f~0.offset_213} OutVars{~i~0=v_~i~0_420, ~f~0.base=v_~f~0.base_213, #memory_int=|v_#memory_int_430|, ~i1~0=v_~i1~0_123, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_51|, ~f~0.offset=v_~f~0.offset_213} AuxVars[] AssignedVars[~i~0, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 04:24:51,723 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:24:51,723 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-13 04:24:51,723 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 1023 transitions, 231536 flow [2022-12-13 04:24:51,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:24:51,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:24:51,724 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] [2022-12-13 04:24:51,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2022-12-13 04:24:51,724 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:24:51,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:24:51,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1730827680, now seen corresponding path program 1 times [2022-12-13 04:24:51,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:24:51,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673704227] [2022-12-13 04:24:51,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:24:51,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:24:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:24:52,389 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:24:52,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:24:52,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673704227] [2022-12-13 04:24:52,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673704227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:24:52,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:24:52,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:24:52,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853824535] [2022-12-13 04:24:52,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:24:52,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:24:52,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:24:52,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:24:52,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:24:52,390 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:24:52,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 1023 transitions, 231536 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:24:52,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:24:52,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:24:52,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:24:57,389 INFO L130 PetriNetUnfolder]: 1990/3728 cut-off events. [2022-12-13 04:24:57,389 INFO L131 PetriNetUnfolder]: For 7393/7393 co-relation queries the response was YES. [2022-12-13 04:24:57,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424655 conditions, 3728 events. 1990/3728 cut-off events. For 7393/7393 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 23231 event pairs, 50 based on Foata normal form. 2/3728 useless extension candidates. Maximal degree in co-relation 245375. Up to 3729 conditions per place. [2022-12-13 04:24:57,480 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 917 selfloop transitions, 64 changer transitions 104/1085 dead transitions. [2022-12-13 04:24:57,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 1085 transitions, 247731 flow [2022-12-13 04:24:57,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 04:24:57,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 04:24:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 160 transitions. [2022-12-13 04:24:57,482 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32388663967611336 [2022-12-13 04:24:57,482 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 321 predicate places. [2022-12-13 04:24:57,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 362 places, 1085 transitions, 247731 flow [2022-12-13 04:24:57,664 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 359 places, 981 transitions, 223958 flow [2022-12-13 04:24:57,756 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:24:57,756 INFO L89 Accepts]: Start accepts. Operand has 359 places, 981 transitions, 223958 flow [2022-12-13 04:24:57,860 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:24:57,860 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:24:57,861 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 359 places, 981 transitions, 223958 flow [2022-12-13 04:24:57,914 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 359 places, 981 transitions, 223958 flow [2022-12-13 04:24:57,915 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:24:57,917 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:24:57,917 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 04:24:57,917 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 981 transitions, 223958 flow [2022-12-13 04:24:57,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:24:57,917 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:24:57,917 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] [2022-12-13 04:24:57,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2022-12-13 04:24:57,917 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:24:57,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:24:57,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1918447351, now seen corresponding path program 1 times [2022-12-13 04:24:57,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:24:57,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205854134] [2022-12-13 04:24:57,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:24:57,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:24:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:24:58,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:24:58,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:24:58,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205854134] [2022-12-13 04:24:58,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205854134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:24:58,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:24:58,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:24:58,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369584217] [2022-12-13 04:24:58,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:24:58,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:24:58,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:24:58,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:24:58,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:24:58,738 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:24:58,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 981 transitions, 223958 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:24:58,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:24:58,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:24:58,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:25:03,048 INFO L130 PetriNetUnfolder]: 1847/3465 cut-off events. [2022-12-13 04:25:03,048 INFO L131 PetriNetUnfolder]: For 6760/6760 co-relation queries the response was YES. [2022-12-13 04:25:03,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398214 conditions, 3465 events. 1847/3465 cut-off events. For 6760/6760 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 21210 event pairs, 40 based on Foata normal form. 2/3465 useless extension candidates. Maximal degree in co-relation 247530. Up to 3466 conditions per place. [2022-12-13 04:25:03,142 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 971 selfloop transitions, 50 changer transitions 46/1067 dead transitions. [2022-12-13 04:25:03,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 1067 transitions, 245790 flow [2022-12-13 04:25:03,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:25:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:25:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2022-12-13 04:25:03,143 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4064327485380117 [2022-12-13 04:25:03,143 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 326 predicate places. [2022-12-13 04:25:03,143 INFO L82 GeneralOperation]: Start removeDead. Operand has 367 places, 1067 transitions, 245790 flow [2022-12-13 04:25:03,288 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 366 places, 1021 transitions, 235156 flow [2022-12-13 04:25:03,457 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:25:03,457 INFO L89 Accepts]: Start accepts. Operand has 366 places, 1021 transitions, 235156 flow [2022-12-13 04:25:03,557 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:25:03,557 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:25:03,557 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 366 places, 1021 transitions, 235156 flow [2022-12-13 04:25:03,624 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 366 places, 1021 transitions, 235156 flow [2022-12-13 04:25:03,624 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:25:03,625 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:25:03,626 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-13 04:25:03,626 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 1021 transitions, 235156 flow [2022-12-13 04:25:03,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:25:03,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:25:03,626 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] [2022-12-13 04:25:03,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2022-12-13 04:25:03,626 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:25:03,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:25:03,627 INFO L85 PathProgramCache]: Analyzing trace with hash 242994168, now seen corresponding path program 1 times [2022-12-13 04:25:03,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:25:03,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966074462] [2022-12-13 04:25:03,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:25:03,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:25:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:25:04,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:25:04,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:25:04,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966074462] [2022-12-13 04:25:04,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966074462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:25:04,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:25:04,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:25:04,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066914559] [2022-12-13 04:25:04,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:25:04,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:25:04,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:25:04,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:25:04,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:25:04,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:25:04,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 1021 transitions, 235156 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:25:04,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:25:04,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:25:04,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:25:09,330 INFO L130 PetriNetUnfolder]: 1976/3734 cut-off events. [2022-12-13 04:25:09,330 INFO L131 PetriNetUnfolder]: For 7970/7970 co-relation queries the response was YES. [2022-12-13 04:25:09,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432782 conditions, 3734 events. 1976/3734 cut-off events. For 7970/7970 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 23623 event pairs, 42 based on Foata normal form. 2/3734 useless extension candidates. Maximal degree in co-relation 249685. Up to 3735 conditions per place. [2022-12-13 04:25:09,427 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 1048 selfloop transitions, 40 changer transitions 60/1148 dead transitions. [2022-12-13 04:25:09,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 1148 transitions, 266727 flow [2022-12-13 04:25:09,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:25:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:25:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2022-12-13 04:25:09,428 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40058479532163743 [2022-12-13 04:25:09,428 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 333 predicate places. [2022-12-13 04:25:09,429 INFO L82 GeneralOperation]: Start removeDead. Operand has 374 places, 1148 transitions, 266727 flow [2022-12-13 04:25:09,580 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 372 places, 1088 transitions, 252785 flow [2022-12-13 04:25:09,761 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:25:09,761 INFO L89 Accepts]: Start accepts. Operand has 372 places, 1088 transitions, 252785 flow [2022-12-13 04:25:09,861 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:25:09,861 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:25:09,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 372 places, 1088 transitions, 252785 flow [2022-12-13 04:25:09,922 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 372 places, 1088 transitions, 252785 flow [2022-12-13 04:25:09,923 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:25:09,924 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:25:09,925 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-13 04:25:09,925 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 1088 transitions, 252785 flow [2022-12-13 04:25:09,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:25:09,925 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:25:09,925 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] [2022-12-13 04:25:09,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2022-12-13 04:25:09,925 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:25:09,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:25:09,925 INFO L85 PathProgramCache]: Analyzing trace with hash 84584681, now seen corresponding path program 2 times [2022-12-13 04:25:09,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:25:09,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704018587] [2022-12-13 04:25:09,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:25:09,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:25:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:25:10,781 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:25:10,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:25:10,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704018587] [2022-12-13 04:25:10,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704018587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:25:10,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:25:10,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:25:10,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671691872] [2022-12-13 04:25:10,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:25:10,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:25:10,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:25:10,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:25:10,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:25:10,782 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:25:10,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 1088 transitions, 252785 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:25:10,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:25:10,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:25:10,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:25:16,672 INFO L130 PetriNetUnfolder]: 1895/3609 cut-off events. [2022-12-13 04:25:16,672 INFO L131 PetriNetUnfolder]: For 7767/7767 co-relation queries the response was YES. [2022-12-13 04:25:16,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421939 conditions, 3609 events. 1895/3609 cut-off events. For 7767/7767 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 22810 event pairs, 44 based on Foata normal form. 2/3609 useless extension candidates. Maximal degree in co-relation 251840. Up to 3610 conditions per place. [2022-12-13 04:25:16,869 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 1031 selfloop transitions, 49 changer transitions 66/1146 dead transitions. [2022-12-13 04:25:16,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 1146 transitions, 268587 flow [2022-12-13 04:25:16,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:25:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:25:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2022-12-13 04:25:16,870 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2022-12-13 04:25:16,870 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 340 predicate places. [2022-12-13 04:25:16,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 381 places, 1146 transitions, 268587 flow [2022-12-13 04:25:17,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 379 places, 1080 transitions, 253121 flow [2022-12-13 04:25:17,094 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:25:17,094 INFO L89 Accepts]: Start accepts. Operand has 379 places, 1080 transitions, 253121 flow [2022-12-13 04:25:17,220 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:25:17,220 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:25:17,220 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 379 places, 1080 transitions, 253121 flow [2022-12-13 04:25:17,320 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 379 places, 1080 transitions, 253121 flow [2022-12-13 04:25:17,320 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:25:17,322 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:25:17,322 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-13 04:25:17,322 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 1080 transitions, 253121 flow [2022-12-13 04:25:17,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:25:17,322 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:25:17,322 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] [2022-12-13 04:25:17,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2022-12-13 04:25:17,322 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:25:17,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:25:17,323 INFO L85 PathProgramCache]: Analyzing trace with hash 996558429, now seen corresponding path program 3 times [2022-12-13 04:25:17,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:25:17,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32257233] [2022-12-13 04:25:17,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:25:17,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:25:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:25:18,660 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:25:18,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:25:18,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32257233] [2022-12-13 04:25:18,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32257233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:25:18,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:25:18,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:25:18,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234171754] [2022-12-13 04:25:18,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:25:18,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:25:18,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:25:18,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:25:18,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:25:18,661 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:25:18,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 1080 transitions, 253121 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:25:18,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:25:18,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:25:18,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:25:23,799 INFO L130 PetriNetUnfolder]: 1790/3444 cut-off events. [2022-12-13 04:25:23,799 INFO L131 PetriNetUnfolder]: For 7378/7378 co-relation queries the response was YES. [2022-12-13 04:25:23,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406124 conditions, 3444 events. 1790/3444 cut-off events. For 7378/7378 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 21740 event pairs, 42 based on Foata normal form. 2/3444 useless extension candidates. Maximal degree in co-relation 253995. Up to 3445 conditions per place. [2022-12-13 04:25:23,898 INFO L137 encePairwiseOnDemand]: 26/38 looper letters, 926 selfloop transitions, 47 changer transitions 129/1102 dead transitions. [2022-12-13 04:25:23,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 1102 transitions, 260497 flow [2022-12-13 04:25:23,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:25:23,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:25:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2022-12-13 04:25:23,903 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3253588516746411 [2022-12-13 04:25:23,904 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 348 predicate places. [2022-12-13 04:25:23,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 389 places, 1102 transitions, 260497 flow [2022-12-13 04:25:24,036 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 385 places, 973 transitions, 229918 flow [2022-12-13 04:25:24,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:25:24,279 INFO L89 Accepts]: Start accepts. Operand has 385 places, 973 transitions, 229918 flow [2022-12-13 04:25:24,371 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:25:24,371 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:25:24,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 385 places, 973 transitions, 229918 flow [2022-12-13 04:25:24,423 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 385 places, 973 transitions, 229918 flow [2022-12-13 04:25:24,423 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:25:24,425 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:25:24,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-13 04:25:24,425 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 973 transitions, 229918 flow [2022-12-13 04:25:24,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:25:24,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:25:24,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] [2022-12-13 04:25:24,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2022-12-13 04:25:24,426 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:25:24,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:25:24,426 INFO L85 PathProgramCache]: Analyzing trace with hash 246784392, now seen corresponding path program 2 times [2022-12-13 04:25:24,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:25:24,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627550357] [2022-12-13 04:25:24,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:25:24,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:25:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:25:25,383 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:25:25,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:25:25,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627550357] [2022-12-13 04:25:25,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627550357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:25:25,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:25:25,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:25:25,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6834055] [2022-12-13 04:25:25,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:25:25,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:25:25,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:25:25,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:25:25,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:25:25,384 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:25:25,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 973 transitions, 229918 flow. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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:25:25,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:25:25,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:25:25,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:25:29,343 INFO L130 PetriNetUnfolder]: 1645/3147 cut-off events. [2022-12-13 04:25:29,343 INFO L131 PetriNetUnfolder]: For 5784/5784 co-relation queries the response was YES. [2022-12-13 04:25:29,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374292 conditions, 3147 events. 1645/3147 cut-off events. For 5784/5784 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 19165 event pairs, 36 based on Foata normal form. 2/3147 useless extension candidates. Maximal degree in co-relation 256150. Up to 3148 conditions per place. [2022-12-13 04:25:29,433 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 918 selfloop transitions, 33 changer transitions 80/1031 dead transitions. [2022-12-13 04:25:29,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 1031 transitions, 245722 flow [2022-12-13 04:25:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:25:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:25:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2022-12-13 04:25:29,434 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3713450292397661 [2022-12-13 04:25:29,434 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 352 predicate places. [2022-12-13 04:25:29,434 INFO L82 GeneralOperation]: Start removeDead. Operand has 393 places, 1031 transitions, 245722 flow [2022-12-13 04:25:29,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 382 places, 951 transitions, 226636 flow [2022-12-13 04:25:29,800 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:25:29,801 INFO L89 Accepts]: Start accepts. Operand has 382 places, 951 transitions, 226636 flow [2022-12-13 04:25:29,880 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:25:29,881 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:25:29,881 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 382 places, 951 transitions, 226636 flow [2022-12-13 04:25:29,934 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 382 places, 951 transitions, 226636 flow [2022-12-13 04:25:29,934 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:25:29,956 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:25:29,957 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-13 04:25:29,957 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 950 transitions, 226412 flow [2022-12-13 04:25:29,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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:25:29,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:25:29,957 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] [2022-12-13 04:25:29,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2022-12-13 04:25:29,957 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:25:29,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:25:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash -661794185, now seen corresponding path program 1 times [2022-12-13 04:25:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:25:29,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587603833] [2022-12-13 04:25:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:25:29,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:25:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:25:32,536 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:25:32,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:25:32,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587603833] [2022-12-13 04:25:32,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587603833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:25:32,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:25:32,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:25:32,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805855715] [2022-12-13 04:25:32,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:25:32,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:25:32,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:25:32,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:25:32,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:25:32,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:25:32,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 950 transitions, 226412 flow. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:25:32,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:25:32,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:25:32,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:25:36,166 INFO L130 PetriNetUnfolder]: 1583/2988 cut-off events. [2022-12-13 04:25:36,166 INFO L131 PetriNetUnfolder]: For 5658/5658 co-relation queries the response was YES. [2022-12-13 04:25:36,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358354 conditions, 2988 events. 1583/2988 cut-off events. For 5658/5658 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 17778 event pairs, 38 based on Foata normal form. 2/2988 useless extension candidates. Maximal degree in co-relation 258305. Up to 2989 conditions per place. [2022-12-13 04:25:36,244 INFO L137 encePairwiseOnDemand]: 28/39 looper letters, 830 selfloop transitions, 34 changer transitions 87/951 dead transitions. [2022-12-13 04:25:36,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 951 transitions, 228552 flow [2022-12-13 04:25:36,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:25:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:25:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-13 04:25:36,245 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2022-12-13 04:25:36,245 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 346 predicate places. [2022-12-13 04:25:36,245 INFO L82 GeneralOperation]: Start removeDead. Operand has 387 places, 951 transitions, 228552 flow [2022-12-13 04:25:36,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 864 transitions, 207607 flow [2022-12-13 04:25:36,443 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:25:36,443 INFO L89 Accepts]: Start accepts. Operand has 375 places, 864 transitions, 207607 flow [2022-12-13 04:25:36,527 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:25:36,527 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:25:36,528 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 864 transitions, 207607 flow [2022-12-13 04:25:36,574 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 864 transitions, 207607 flow [2022-12-13 04:25:36,574 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:25:36,575 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:25:36,576 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 04:25:36,576 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 864 transitions, 207607 flow [2022-12-13 04:25:36,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:25:36,576 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:25:36,576 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] [2022-12-13 04:25:36,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2022-12-13 04:25:36,576 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:25:36,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:25:36,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1573428684, now seen corresponding path program 2 times [2022-12-13 04:25:36,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:25:36,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135509268] [2022-12-13 04:25:36,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:25:36,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:25:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:25:37,333 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:25:37,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:25:37,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135509268] [2022-12-13 04:25:37,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135509268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:25:37,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:25:37,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:25:37,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264700896] [2022-12-13 04:25:37,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:25:37,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:25:37,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:25:37,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:25:37,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:25:37,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:25:37,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 864 transitions, 207607 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:25:37,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:25:37,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:25:37,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:25:40,670 INFO L130 PetriNetUnfolder]: 1522/2851 cut-off events. [2022-12-13 04:25:40,670 INFO L131 PetriNetUnfolder]: For 5623/5623 co-relation queries the response was YES. [2022-12-13 04:25:40,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344735 conditions, 2851 events. 1522/2851 cut-off events. For 5623/5623 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 16635 event pairs, 36 based on Foata normal form. 2/2851 useless extension candidates. Maximal degree in co-relation 260460. Up to 2852 conditions per place. [2022-12-13 04:25:40,873 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 810 selfloop transitions, 42 changer transitions 34/886 dead transitions. [2022-12-13 04:25:40,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 886 transitions, 214677 flow [2022-12-13 04:25:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:25:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:25:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2022-12-13 04:25:40,874 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32222222222222224 [2022-12-13 04:25:40,875 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 343 predicate places. [2022-12-13 04:25:40,875 INFO L82 GeneralOperation]: Start removeDead. Operand has 384 places, 886 transitions, 214677 flow [2022-12-13 04:25:41,007 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 381 places, 852 transitions, 206453 flow [2022-12-13 04:25:41,082 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:25:41,082 INFO L89 Accepts]: Start accepts. Operand has 381 places, 852 transitions, 206453 flow [2022-12-13 04:25:41,171 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:25:41,172 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:25:41,172 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 381 places, 852 transitions, 206453 flow [2022-12-13 04:25:41,257 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 381 places, 852 transitions, 206453 flow [2022-12-13 04:25:41,257 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:25:41,258 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:25:41,258 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-13 04:25:41,258 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 852 transitions, 206453 flow [2022-12-13 04:25:41,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:25:41,259 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:25:41,259 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] [2022-12-13 04:25:41,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2022-12-13 04:25:41,259 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:25:41,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:25:41,259 INFO L85 PathProgramCache]: Analyzing trace with hash -858024040, now seen corresponding path program 3 times [2022-12-13 04:25:41,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:25:41,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741010250] [2022-12-13 04:25:41,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:25:41,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:25:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:25:42,083 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:25:42,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:25:42,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741010250] [2022-12-13 04:25:42,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741010250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:25:42,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:25:42,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:25:42,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542530087] [2022-12-13 04:25:42,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:25:42,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:25:42,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:25:42,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:25:42,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:25:42,084 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:25:42,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 852 transitions, 206453 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:25:42,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:25:42,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:25:42,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:25:45,419 INFO L130 PetriNetUnfolder]: 1508/2801 cut-off events. [2022-12-13 04:25:45,419 INFO L131 PetriNetUnfolder]: For 5463/5463 co-relation queries the response was YES. [2022-12-13 04:25:45,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341505 conditions, 2801 events. 1508/2801 cut-off events. For 5463/5463 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 16156 event pairs, 36 based on Foata normal form. 2/2801 useless extension candidates. Maximal degree in co-relation 262615. Up to 2802 conditions per place. [2022-12-13 04:25:45,494 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 687 selfloop transitions, 28 changer transitions 137/852 dead transitions. [2022-12-13 04:25:45,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 852 transitions, 208157 flow [2022-12-13 04:25:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:25:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:25:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2022-12-13 04:25:45,495 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28055555555555556 [2022-12-13 04:25:45,495 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 349 predicate places. [2022-12-13 04:25:45,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 390 places, 852 transitions, 208157 flow [2022-12-13 04:25:45,712 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 365 places, 715 transitions, 174723 flow [2022-12-13 04:25:45,787 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:25:45,788 INFO L89 Accepts]: Start accepts. Operand has 365 places, 715 transitions, 174723 flow [2022-12-13 04:25:45,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:25:45,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:25:45,857 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 365 places, 715 transitions, 174723 flow [2022-12-13 04:25:45,899 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 365 places, 715 transitions, 174723 flow [2022-12-13 04:25:45,899 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:25:50,330 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:25:50,331 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4544 [2022-12-13 04:25:50,331 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 714 transitions, 174479 flow [2022-12-13 04:25:50,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:25:50,331 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:25:50,332 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] [2022-12-13 04:25:50,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2022-12-13 04:25:50,332 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:25:50,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:25:50,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1047919801, now seen corresponding path program 1 times [2022-12-13 04:25:50,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:25:50,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085042275] [2022-12-13 04:25:50,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:25:50,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:25:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:25:51,282 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:25:51,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:25:51,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085042275] [2022-12-13 04:25:51,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085042275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:25:51,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:25:51,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:25:51,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403521794] [2022-12-13 04:25:51,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:25:51,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:25:51,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:25:51,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:25:51,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:25:51,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:25:51,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 714 transitions, 174479 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:25:51,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:25:51,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:25:51,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:25:57,586 INFO L130 PetriNetUnfolder]: 2957/5520 cut-off events. [2022-12-13 04:25:57,587 INFO L131 PetriNetUnfolder]: For 11527/11527 co-relation queries the response was YES. [2022-12-13 04:25:57,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678405 conditions, 5520 events. 2957/5520 cut-off events. For 11527/11527 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 37238 event pairs, 92 based on Foata normal form. 4/5522 useless extension candidates. Maximal degree in co-relation 316738. Up to 5521 conditions per place. [2022-12-13 04:25:57,814 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 1382 selfloop transitions, 106 changer transitions 148/1636 dead transitions. [2022-12-13 04:25:57,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 1636 transitions, 403157 flow [2022-12-13 04:25:57,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:25:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:25:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-12-13 04:25:57,815 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39141414141414144 [2022-12-13 04:25:57,815 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 320 predicate places. [2022-12-13 04:25:57,815 INFO L82 GeneralOperation]: Start removeDead. Operand has 361 places, 1636 transitions, 403157 flow [2022-12-13 04:25:58,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 359 places, 1488 transitions, 366563 flow [2022-12-13 04:25:58,242 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:25:58,242 INFO L89 Accepts]: Start accepts. Operand has 359 places, 1488 transitions, 366563 flow [2022-12-13 04:25:58,432 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:25:58,432 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:25:58,432 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 359 places, 1488 transitions, 366563 flow [2022-12-13 04:25:58,552 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 359 places, 1488 transitions, 366563 flow [2022-12-13 04:25:58,552 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:25:58,556 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:25:58,574 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:25:58,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:25:58,617 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 04:25:58,640 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:25:58,641 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 399 [2022-12-13 04:25:58,641 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 1487 transitions, 366339 flow [2022-12-13 04:25:58,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:25:58,641 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:25:58,641 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] [2022-12-13 04:25:58,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2022-12-13 04:25:58,641 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:25:58,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:25:58,642 INFO L85 PathProgramCache]: Analyzing trace with hash 59350423, now seen corresponding path program 2 times [2022-12-13 04:25:58,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:25:58,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025423712] [2022-12-13 04:25:58,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:25:58,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:25:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:25:59,539 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:25:59,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:25:59,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025423712] [2022-12-13 04:25:59,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025423712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:25:59,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:25:59,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:25:59,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538827979] [2022-12-13 04:25:59,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:25:59,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:25:59,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:25:59,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:25:59,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:25:59,540 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 04:25:59,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 1487 transitions, 366339 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:25:59,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:25:59,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 04:25:59,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:11,112 INFO L130 PetriNetUnfolder]: 2850/5399 cut-off events. [2022-12-13 04:26:11,112 INFO L131 PetriNetUnfolder]: For 9403/9403 co-relation queries the response was YES. [2022-12-13 04:26:11,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668926 conditions, 5399 events. 2850/5399 cut-off events. For 9403/9403 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 36913 event pairs, 81 based on Foata normal form. 4/5401 useless extension candidates. Maximal degree in co-relation 300409. Up to 5400 conditions per place. [2022-12-13 04:26:11,247 INFO L137 encePairwiseOnDemand]: 21/40 looper letters, 1239 selfloop transitions, 85 changer transitions 277/1601 dead transitions. [2022-12-13 04:26:11,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 1601 transitions, 397649 flow [2022-12-13 04:26:11,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:26:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:26:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 159 transitions. [2022-12-13 04:26:11,248 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33125 [2022-12-13 04:26:11,248 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 328 predicate places. [2022-12-13 04:26:11,248 INFO L82 GeneralOperation]: Start removeDead. Operand has 369 places, 1601 transitions, 397649 flow [2022-12-13 04:26:11,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 364 places, 1324 transitions, 328796 flow [2022-12-13 04:26:11,669 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:11,669 INFO L89 Accepts]: Start accepts. Operand has 364 places, 1324 transitions, 328796 flow [2022-12-13 04:26:11,920 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:11,920 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:11,920 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 364 places, 1324 transitions, 328796 flow [2022-12-13 04:26:11,999 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 364 places, 1324 transitions, 328796 flow [2022-12-13 04:26:11,999 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:12,001 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:12,002 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 333 [2022-12-13 04:26:12,003 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 1324 transitions, 328796 flow [2022-12-13 04:26:12,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:12,003 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:12,003 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] [2022-12-13 04:26:12,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2022-12-13 04:26:12,003 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:26:12,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:12,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1460942721, now seen corresponding path program 1 times [2022-12-13 04:26:12,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:12,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772776367] [2022-12-13 04:26:12,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:12,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:12,750 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:12,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:12,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772776367] [2022-12-13 04:26:12,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772776367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:12,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:12,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:26:12,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670136625] [2022-12-13 04:26:12,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:12,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:26:12,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:12,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:26:12,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:26:12,751 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 04:26:12,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 1324 transitions, 328796 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:12,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 04:26:12,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:22,989 INFO L130 PetriNetUnfolder]: 2462/4811 cut-off events. [2022-12-13 04:26:22,989 INFO L131 PetriNetUnfolder]: For 8120/8120 co-relation queries the response was YES. [2022-12-13 04:26:22,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600785 conditions, 4811 events. 2462/4811 cut-off events. For 8120/8120 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 33341 event pairs, 66 based on Foata normal form. 4/4813 useless extension candidates. Maximal degree in co-relation 269080. Up to 4812 conditions per place. [2022-12-13 04:26:23,196 INFO L137 encePairwiseOnDemand]: 23/40 looper letters, 981 selfloop transitions, 44 changer transitions 319/1344 dead transitions. [2022-12-13 04:26:23,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 1344 transitions, 336468 flow [2022-12-13 04:26:23,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:26:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:26:23,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2022-12-13 04:26:23,197 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2022-12-13 04:26:23,197 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 333 predicate places. [2022-12-13 04:26:23,197 INFO L82 GeneralOperation]: Start removeDead. Operand has 374 places, 1344 transitions, 336468 flow [2022-12-13 04:26:23,367 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 371 places, 1025 transitions, 256572 flow [2022-12-13 04:26:23,556 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:23,556 INFO L89 Accepts]: Start accepts. Operand has 371 places, 1025 transitions, 256572 flow [2022-12-13 04:26:23,641 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:23,641 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:23,641 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 371 places, 1025 transitions, 256572 flow [2022-12-13 04:26:23,705 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 371 places, 1025 transitions, 256572 flow [2022-12-13 04:26:23,705 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:23,744 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [505] L68-->L71: Formula: (= v_~i~0_24 (select (select |v_#memory_int_30| v_~f~0.base_19) (+ v_~f~0.offset_19 (* v_~i1~0_7 4)))) InVars {#memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, ~f~0.base=v_~f~0.base_19, ~f~0.offset=v_~f~0.offset_19} OutVars{~i~0=v_~i~0_24, ~f~0.base=v_~f~0.base_19, #memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~f~0.offset=v_~f~0.offset_19} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_#t~mem1#1] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 04:26:23,811 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:26:23,812 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-13 04:26:23,812 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 1023 transitions, 256088 flow [2022-12-13 04:26:23,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:23,812 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:23,812 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] [2022-12-13 04:26:23,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2022-12-13 04:26:23,812 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:26:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:23,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1911885712, now seen corresponding path program 1 times [2022-12-13 04:26:23,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:23,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872376626] [2022-12-13 04:26:23,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:23,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:24,745 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:24,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:24,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872376626] [2022-12-13 04:26:24,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872376626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:24,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:24,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:26:24,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022949021] [2022-12-13 04:26:24,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:24,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:26:24,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:24,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:26:24,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:26:24,746 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:26:24,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 1023 transitions, 256088 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:24,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:24,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:26:24,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:30,023 INFO L130 PetriNetUnfolder]: 1990/3728 cut-off events. [2022-12-13 04:26:30,023 INFO L131 PetriNetUnfolder]: For 7388/7388 co-relation queries the response was YES. [2022-12-13 04:26:30,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469403 conditions, 3728 events. 1990/3728 cut-off events. For 7388/7388 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 23229 event pairs, 48 based on Foata normal form. 2/3728 useless extension candidates. Maximal degree in co-relation 271235. Up to 3729 conditions per place. [2022-12-13 04:26:30,268 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 927 selfloop transitions, 54 changer transitions 104/1085 dead transitions. [2022-12-13 04:26:30,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 1085 transitions, 273771 flow [2022-12-13 04:26:30,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:26:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:26:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2022-12-13 04:26:30,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3267543859649123 [2022-12-13 04:26:30,269 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 337 predicate places. [2022-12-13 04:26:30,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 378 places, 1085 transitions, 273771 flow [2022-12-13 04:26:30,408 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 981 transitions, 247502 flow [2022-12-13 04:26:30,509 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:30,509 INFO L89 Accepts]: Start accepts. Operand has 375 places, 981 transitions, 247502 flow [2022-12-13 04:26:30,644 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:30,644 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:30,644 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 981 transitions, 247502 flow [2022-12-13 04:26:30,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 981 transitions, 247502 flow [2022-12-13 04:26:30,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:30,705 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:30,705 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-13 04:26:30,706 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 981 transitions, 247502 flow [2022-12-13 04:26:30,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:30,706 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:30,706 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] [2022-12-13 04:26:30,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2022-12-13 04:26:30,706 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:26:30,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:30,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1832918051, now seen corresponding path program 1 times [2022-12-13 04:26:30,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:30,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416200227] [2022-12-13 04:26:30,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:30,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:32,969 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:32,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:32,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416200227] [2022-12-13 04:26:32,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416200227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:32,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:32,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:26:32,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030163574] [2022-12-13 04:26:32,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:32,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:26:32,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:32,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:26:32,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:26:32,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:26:32,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 981 transitions, 247502 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:32,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:32,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:26:32,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:38,012 INFO L130 PetriNetUnfolder]: 1847/3465 cut-off events. [2022-12-13 04:26:38,013 INFO L131 PetriNetUnfolder]: For 6759/6759 co-relation queries the response was YES. [2022-12-13 04:26:38,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439806 conditions, 3465 events. 1847/3465 cut-off events. For 6759/6759 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 21202 event pairs, 42 based on Foata normal form. 2/3465 useless extension candidates. Maximal degree in co-relation 273390. Up to 3466 conditions per place. [2022-12-13 04:26:38,123 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 971 selfloop transitions, 50 changer transitions 46/1067 dead transitions. [2022-12-13 04:26:38,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 1067 transitions, 271398 flow [2022-12-13 04:26:38,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:26:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:26:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2022-12-13 04:26:38,124 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4064327485380117 [2022-12-13 04:26:38,124 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 342 predicate places. [2022-12-13 04:26:38,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 383 places, 1067 transitions, 271398 flow [2022-12-13 04:26:38,435 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 382 places, 1021 transitions, 259660 flow [2022-12-13 04:26:38,530 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:38,531 INFO L89 Accepts]: Start accepts. Operand has 382 places, 1021 transitions, 259660 flow [2022-12-13 04:26:38,696 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:38,696 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:38,696 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 382 places, 1021 transitions, 259660 flow [2022-12-13 04:26:38,762 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 382 places, 1021 transitions, 259660 flow [2022-12-13 04:26:38,762 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:38,764 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:38,764 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-13 04:26:38,764 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 1021 transitions, 259660 flow [2022-12-13 04:26:38,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:38,765 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:38,765 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] [2022-12-13 04:26:38,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2022-12-13 04:26:38,765 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:26:38,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:38,765 INFO L85 PathProgramCache]: Analyzing trace with hash 759673749, now seen corresponding path program 2 times [2022-12-13 04:26:38,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:38,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102395341] [2022-12-13 04:26:38,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:38,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:39,539 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:39,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:39,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102395341] [2022-12-13 04:26:39,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102395341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:39,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:39,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:26:39,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398507803] [2022-12-13 04:26:39,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:39,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:26:39,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:39,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:26:39,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:26:39,540 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:26:39,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 1021 transitions, 259660 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:39,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:39,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:26:39,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:44,744 INFO L130 PetriNetUnfolder]: 1801/3423 cut-off events. [2022-12-13 04:26:44,745 INFO L131 PetriNetUnfolder]: For 6916/6916 co-relation queries the response was YES. [2022-12-13 04:26:44,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437878 conditions, 3423 events. 1801/3423 cut-off events. For 6916/6916 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 21208 event pairs, 38 based on Foata normal form. 2/3423 useless extension candidates. Maximal degree in co-relation 275545. Up to 3424 conditions per place. [2022-12-13 04:26:44,982 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 970 selfloop transitions, 43 changer transitions 66/1079 dead transitions. [2022-12-13 04:26:44,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 1079 transitions, 276604 flow [2022-12-13 04:26:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:26:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:26:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2022-12-13 04:26:44,984 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2022-12-13 04:26:44,984 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 350 predicate places. [2022-12-13 04:26:44,984 INFO L82 GeneralOperation]: Start removeDead. Operand has 391 places, 1079 transitions, 276604 flow [2022-12-13 04:26:45,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 389 places, 1013 transitions, 259686 flow [2022-12-13 04:26:45,286 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:45,287 INFO L89 Accepts]: Start accepts. Operand has 389 places, 1013 transitions, 259686 flow [2022-12-13 04:26:45,389 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:45,390 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:45,390 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 389 places, 1013 transitions, 259686 flow [2022-12-13 04:26:45,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 389 places, 1013 transitions, 259686 flow [2022-12-13 04:26:45,456 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:45,458 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:45,459 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-13 04:26:45,459 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 1013 transitions, 259686 flow [2022-12-13 04:26:45,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:45,459 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:45,459 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] [2022-12-13 04:26:45,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2022-12-13 04:26:45,460 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:26:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:45,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2138082626, now seen corresponding path program 1 times [2022-12-13 04:26:45,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:45,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302045679] [2022-12-13 04:26:45,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:45,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:46,260 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:46,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:46,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302045679] [2022-12-13 04:26:46,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302045679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:46,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:46,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:26:46,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132664762] [2022-12-13 04:26:46,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:46,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:26:46,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:46,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:26:46,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:26:46,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 04:26:46,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 1013 transitions, 259686 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:46,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:46,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 04:26:46,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:51,334 INFO L130 PetriNetUnfolder]: 1696/3258 cut-off events. [2022-12-13 04:26:51,335 INFO L131 PetriNetUnfolder]: For 6524/6524 co-relation queries the response was YES. [2022-12-13 04:26:51,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420062 conditions, 3258 events. 1696/3258 cut-off events. For 6524/6524 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 20184 event pairs, 34 based on Foata normal form. 2/3258 useless extension candidates. Maximal degree in co-relation 277700. Up to 3259 conditions per place. [2022-12-13 04:26:51,513 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 914 selfloop transitions, 41 changer transitions 80/1035 dead transitions. [2022-12-13 04:26:51,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 1035 transitions, 267412 flow [2022-12-13 04:26:51,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:26:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:26:51,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2022-12-13 04:26:51,514 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3394736842105263 [2022-12-13 04:26:51,515 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 357 predicate places. [2022-12-13 04:26:51,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 398 places, 1035 transitions, 267412 flow [2022-12-13 04:26:51,650 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 395 places, 955 transitions, 246688 flow [2022-12-13 04:26:51,796 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:51,796 INFO L89 Accepts]: Start accepts. Operand has 395 places, 955 transitions, 246688 flow [2022-12-13 04:26:51,894 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:51,894 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:51,894 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 395 places, 955 transitions, 246688 flow [2022-12-13 04:26:51,954 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 395 places, 955 transitions, 246688 flow [2022-12-13 04:26:51,955 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:51,978 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:26:51,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-13 04:26:51,979 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 954 transitions, 246444 flow [2022-12-13 04:26:51,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:51,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:51,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] [2022-12-13 04:26:51,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2022-12-13 04:26:51,979 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:26:51,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:51,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1133833730, now seen corresponding path program 1 times [2022-12-13 04:26:51,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:51,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209469790] [2022-12-13 04:26:51,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:51,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:52,735 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:52,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:52,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209469790] [2022-12-13 04:26:52,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209469790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:52,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:52,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:26:52,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067960104] [2022-12-13 04:26:52,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:52,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:26:52,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:52,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:26:52,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:26:52,737 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 04:26:52,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 954 transitions, 246444 flow. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:52,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:52,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 04:26:52,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:57,311 INFO L130 PetriNetUnfolder]: 1645/3143 cut-off events. [2022-12-13 04:26:57,312 INFO L131 PetriNetUnfolder]: For 5703/5703 co-relation queries the response was YES. [2022-12-13 04:26:57,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408428 conditions, 3143 events. 1645/3143 cut-off events. For 5703/5703 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 19132 event pairs, 42 based on Foata normal form. 2/3143 useless extension candidates. Maximal degree in co-relation 279855. Up to 3144 conditions per place. [2022-12-13 04:26:57,499 INFO L137 encePairwiseOnDemand]: 27/40 looper letters, 911 selfloop transitions, 35 changer transitions 83/1029 dead transitions. [2022-12-13 04:26:57,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 1029 transitions, 267912 flow [2022-12-13 04:26:57,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:26:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:26:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2022-12-13 04:26:57,500 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 04:26:57,500 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 360 predicate places. [2022-12-13 04:26:57,500 INFO L82 GeneralOperation]: Start removeDead. Operand has 401 places, 1029 transitions, 267912 flow [2022-12-13 04:26:57,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 397 places, 946 transitions, 246267 flow [2022-12-13 04:26:57,724 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:57,725 INFO L89 Accepts]: Start accepts. Operand has 397 places, 946 transitions, 246267 flow [2022-12-13 04:26:57,888 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:57,888 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:57,888 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 397 places, 946 transitions, 246267 flow [2022-12-13 04:26:57,944 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 397 places, 946 transitions, 246267 flow [2022-12-13 04:26:57,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:57,946 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:57,946 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-13 04:26:57,946 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 946 transitions, 246267 flow [2022-12-13 04:26:57,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:57,946 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:57,946 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] [2022-12-13 04:26:57,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2022-12-13 04:26:57,946 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:26:57,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:57,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1669205505, now seen corresponding path program 1 times [2022-12-13 04:26:57,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:57,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535701051] [2022-12-13 04:26:57,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:57,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:27:00,049 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:00,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:27:00,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535701051] [2022-12-13 04:27:00,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535701051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:27:00,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:27:00,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:27:00,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649691091] [2022-12-13 04:27:00,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:27:00,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:27:00,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:27:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:27:00,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:27:00,050 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:27:00,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 946 transitions, 246267 flow. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:00,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:27:00,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:27:00,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:27:04,182 INFO L130 PetriNetUnfolder]: 1580/2986 cut-off events. [2022-12-13 04:27:04,182 INFO L131 PetriNetUnfolder]: For 5661/5661 co-relation queries the response was YES. [2022-12-13 04:27:04,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390968 conditions, 2986 events. 1580/2986 cut-off events. For 5661/5661 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 17767 event pairs, 42 based on Foata normal form. 2/2986 useless extension candidates. Maximal degree in co-relation 282010. Up to 2987 conditions per place. [2022-12-13 04:27:04,294 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 829 selfloop transitions, 32 changer transitions 83/944 dead transitions. [2022-12-13 04:27:04,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 944 transitions, 247635 flow [2022-12-13 04:27:04,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:27:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:27:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2022-12-13 04:27:04,295 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3814102564102564 [2022-12-13 04:27:04,295 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 363 predicate places. [2022-12-13 04:27:04,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 404 places, 944 transitions, 247635 flow [2022-12-13 04:27:04,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 390 places, 861 transitions, 225829 flow [2022-12-13 04:27:04,571 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:27:04,572 INFO L89 Accepts]: Start accepts. Operand has 390 places, 861 transitions, 225829 flow [2022-12-13 04:27:04,653 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:27:04,654 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:27:04,654 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 390 places, 861 transitions, 225829 flow [2022-12-13 04:27:04,706 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 390 places, 861 transitions, 225829 flow [2022-12-13 04:27:04,706 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:27:04,708 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:27:04,708 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 04:27:04,708 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 861 transitions, 225829 flow [2022-12-13 04:27:04,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:04,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:27:04,708 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] [2022-12-13 04:27:04,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2022-12-13 04:27:04,708 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:27:04,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:27:04,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1494661824, now seen corresponding path program 2 times [2022-12-13 04:27:04,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:27:04,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352751095] [2022-12-13 04:27:04,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:27:04,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:27:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:27:05,524 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:05,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:27:05,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352751095] [2022-12-13 04:27:05,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352751095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:27:05,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:27:05,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:27:05,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816737407] [2022-12-13 04:27:05,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:27:05,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:27:05,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:27:05,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:27:05,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:27:05,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:27:05,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 861 transitions, 225829 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:05,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:27:05,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:27:05,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:27:09,317 INFO L130 PetriNetUnfolder]: 1522/2851 cut-off events. [2022-12-13 04:27:09,317 INFO L131 PetriNetUnfolder]: For 5625/5625 co-relation queries the response was YES. [2022-12-13 04:27:09,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376107 conditions, 2851 events. 1522/2851 cut-off events. For 5625/5625 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 16662 event pairs, 40 based on Foata normal form. 2/2851 useless extension candidates. Maximal degree in co-relation 284165. Up to 2852 conditions per place. [2022-12-13 04:27:09,400 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 795 selfloop transitions, 38 changer transitions 53/886 dead transitions. [2022-12-13 04:27:09,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 886 transitions, 234169 flow [2022-12-13 04:27:09,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:27:09,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:27:09,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2022-12-13 04:27:09,401 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3138888888888889 [2022-12-13 04:27:09,401 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 358 predicate places. [2022-12-13 04:27:09,401 INFO L82 GeneralOperation]: Start removeDead. Operand has 399 places, 886 transitions, 234169 flow [2022-12-13 04:27:09,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 397 places, 833 transitions, 220173 flow [2022-12-13 04:27:09,688 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:27:09,688 INFO L89 Accepts]: Start accepts. Operand has 397 places, 833 transitions, 220173 flow [2022-12-13 04:27:09,767 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:27:09,767 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:27:09,767 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 397 places, 833 transitions, 220173 flow [2022-12-13 04:27:09,819 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 397 places, 833 transitions, 220173 flow [2022-12-13 04:27:09,819 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:27:09,820 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:27:09,820 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 04:27:09,821 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 833 transitions, 220173 flow [2022-12-13 04:27:09,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:09,821 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:27:09,821 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] [2022-12-13 04:27:09,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2022-12-13 04:27:09,821 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:27:09,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:27:09,821 INFO L85 PathProgramCache]: Analyzing trace with hash -981006832, now seen corresponding path program 3 times [2022-12-13 04:27:09,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:27:09,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288869820] [2022-12-13 04:27:09,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:27:09,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:27:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:27:10,670 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:10,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:27:10,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288869820] [2022-12-13 04:27:10,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288869820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:27:10,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:27:10,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:27:10,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827414085] [2022-12-13 04:27:10,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:27:10,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:27:10,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:27:10,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:27:10,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:27:10,671 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 04:27:10,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 833 transitions, 220173 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:10,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:27:10,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 04:27:10,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 04:27:13,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:27:13,545 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 04:27:13,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2022-12-13 04:27:13,546 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (10states, 0/36 universal loopers) in iteration 132,while PetriNetUnfolder was constructing finite prefix that currently has 321199 conditions, 2417 events (1327/2416 cut-off events. For 4748/4748 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14262 event pairs, 24 based on Foata normal form. 0/2461 useless extension candidates. Maximal degree in co-relation 273698. Up to 2417 conditions per place.). [2022-12-13 04:27:13,547 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 04:27:13,547 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 04:27:13,547 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 04:27:13,548 INFO L445 BasicCegarLoop]: Path program histogram: [9, 7, 6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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,550 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 04:27:13,550 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 04:27:13,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:27:13 BasicIcfg [2022-12-13 04:27:13,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 04:27:13,552 INFO L158 Benchmark]: Toolchain (without parser) took 804108.45ms. Allocated memory was 176.2MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 151.7MB in the beginning and 4.3GB in the end (delta: -4.1GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-13 04:27:13,552 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 04:27:13,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.83ms. Allocated memory is still 176.2MB. Free memory was 151.7MB in the beginning and 134.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 04:27:13,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.91ms. Allocated memory is still 176.2MB. Free memory was 134.6MB in the beginning and 132.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:27:13,552 INFO L158 Benchmark]: Boogie Preprocessor took 29.63ms. Allocated memory is still 176.2MB. Free memory was 132.5MB in the beginning and 130.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:27:13,552 INFO L158 Benchmark]: RCFGBuilder took 545.75ms. Allocated memory is still 176.2MB. Free memory was 130.4MB in the beginning and 105.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 04:27:13,552 INFO L158 Benchmark]: TraceAbstraction took 803224.27ms. Allocated memory was 176.2MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 104.2MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-13 04:27:13,553 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.13ms. Allocated memory is still 176.2MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.83ms. Allocated memory is still 176.2MB. Free memory was 151.7MB in the beginning and 134.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.91ms. Allocated memory is still 176.2MB. Free memory was 134.6MB in the beginning and 132.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.63ms. Allocated memory is still 176.2MB. Free memory was 132.5MB in the beginning and 130.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 545.75ms. Allocated memory is still 176.2MB. Free memory was 130.4MB in the beginning and 105.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 803224.27ms. Allocated memory was 176.2MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 104.2MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 162 PlacesBefore, 41 PlacesAfterwards, 159 TransitionsBefore, 32 TransitionsAfterwards, 1266 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 97 TrivialYvCompositions, 24 ConcurrentYvCompositions, 6 ChoiceCompositions, 127 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1198, independent: 1108, independent conditional: 1108, independent unconditional: 0, dependent: 90, dependent conditional: 90, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1198, independent: 1108, independent conditional: 0, independent unconditional: 1108, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1198, independent: 1108, independent conditional: 0, independent unconditional: 1108, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1198, independent: 1108, independent conditional: 0, independent unconditional: 1108, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 772, independent: 741, independent conditional: 0, independent unconditional: 741, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 772, independent: 732, independent conditional: 0, independent unconditional: 732, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1198, independent: 367, independent conditional: 0, independent unconditional: 367, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 772, unknown conditional: 0, unknown unconditional: 772] , Statistics on independence cache: Total cache size (in pairs): 1007, Positive cache size: 976, Positive conditional cache size: 0, Positive unconditional cache size: 976, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, 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: 1.3s, 43 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 32 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.2s, 50 PlacesBefore, 50 PlacesAfterwards, 119 TransitionsBefore, 119 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, 61 PlacesBefore, 61 PlacesAfterwards, 668 TransitionsBefore, 668 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, 71 PlacesBefore, 71 PlacesAfterwards, 1144 TransitionsBefore, 1144 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, 96 PlacesBefore, 96 PlacesAfterwards, 2219 TransitionsBefore, 2219 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: 1.6s, 68 PlacesBefore, 65 PlacesAfterwards, 345 TransitionsBefore, 344 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, 73 PlacesBefore, 73 PlacesAfterwards, 1041 TransitionsBefore, 1041 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, 84 PlacesBefore, 84 PlacesAfterwards, 1509 TransitionsBefore, 1509 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, 1448 TransitionsBefore, 1448 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, 1608 TransitionsBefore, 1608 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, 112 PlacesBefore, 112 PlacesAfterwards, 1806 TransitionsBefore, 1806 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, 2112 TransitionsBefore, 2112 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, 2243 TransitionsBefore, 2243 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.4s, 144 PlacesBefore, 143 PlacesAfterwards, 2382 TransitionsBefore, 2381 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, 145 PlacesBefore, 145 PlacesAfterwards, 2101 TransitionsBefore, 2101 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, 147 PlacesBefore, 147 PlacesAfterwards, 2130 TransitionsBefore, 2130 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, 157 PlacesBefore, 157 PlacesAfterwards, 2359 TransitionsBefore, 2359 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, 165 PlacesBefore, 165 PlacesAfterwards, 1712 TransitionsBefore, 1712 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, 173 PlacesBefore, 173 PlacesAfterwards, 1112 TransitionsBefore, 1112 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, 180 PlacesBefore, 180 PlacesAfterwards, 1215 TransitionsBefore, 1215 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, 189 PlacesBefore, 189 PlacesAfterwards, 1486 TransitionsBefore, 1486 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, 198 PlacesBefore, 198 PlacesAfterwards, 1553 TransitionsBefore, 1553 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, 208 PlacesBefore, 208 PlacesAfterwards, 1659 TransitionsBefore, 1659 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, 216 PlacesBefore, 216 PlacesAfterwards, 1662 TransitionsBefore, 1662 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, 224 PlacesBefore, 224 PlacesAfterwards, 1891 TransitionsBefore, 1891 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, 207 PlacesBefore, 193 PlacesAfterwards, 1093 TransitionsBefore, 1091 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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, 1098 TransitionsBefore, 1098 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, 210 PlacesBefore, 210 PlacesAfterwards, 1160 TransitionsBefore, 1160 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, 216 PlacesBefore, 216 PlacesAfterwards, 1144 TransitionsBefore, 1144 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, 223 PlacesBefore, 221 PlacesAfterwards, 1048 TransitionsBefore, 1047 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, 224 PlacesBefore, 224 PlacesAfterwards, 1039 TransitionsBefore, 1039 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: 3.0s, 207 PlacesBefore, 205 PlacesAfterwards, 954 TransitionsBefore, 953 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, 213 PlacesBefore, 213 PlacesAfterwards, 960 TransitionsBefore, 960 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, 158 PlacesBefore, 158 PlacesAfterwards, 804 TransitionsBefore, 804 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, 168 PlacesBefore, 168 PlacesAfterwards, 1776 TransitionsBefore, 1776 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, 176 PlacesBefore, 174 PlacesAfterwards, 1688 TransitionsBefore, 1687 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, 180 PlacesBefore, 180 PlacesAfterwards, 1651 TransitionsBefore, 1651 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, 186 PlacesBefore, 186 PlacesAfterwards, 1658 TransitionsBefore, 1658 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, 195 PlacesBefore, 195 PlacesAfterwards, 1642 TransitionsBefore, 1642 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, 202 PlacesBefore, 193 PlacesAfterwards, 1442 TransitionsBefore, 1440 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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, 198 PlacesBefore, 198 PlacesAfterwards, 1230 TransitionsBefore, 1230 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, 207 PlacesBefore, 207 PlacesAfterwards, 1308 TransitionsBefore, 1308 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, 212 PlacesBefore, 212 PlacesAfterwards, 1365 TransitionsBefore, 1365 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, 209 PlacesBefore, 209 PlacesAfterwards, 1304 TransitionsBefore, 1304 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, 215 PlacesBefore, 215 PlacesAfterwards, 1272 TransitionsBefore, 1272 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, 207 PlacesBefore, 207 PlacesAfterwards, 1093 TransitionsBefore, 1093 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, 215 PlacesBefore, 215 PlacesAfterwards, 1049 TransitionsBefore, 1049 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, 223 PlacesBefore, 223 PlacesAfterwards, 1031 TransitionsBefore, 1031 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, 234 PlacesBefore, 234 PlacesAfterwards, 1041 TransitionsBefore, 1041 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, 239 PlacesBefore, 239 PlacesAfterwards, 1002 TransitionsBefore, 1002 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, 241 PlacesBefore, 241 PlacesAfterwards, 1026 TransitionsBefore, 1026 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, 249 PlacesBefore, 249 PlacesAfterwards, 1000 TransitionsBefore, 1000 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: 3.3s, 257 PlacesBefore, 256 PlacesAfterwards, 998 TransitionsBefore, 997 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, 201 PlacesBefore, 201 PlacesAfterwards, 845 TransitionsBefore, 845 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, 211 PlacesBefore, 211 PlacesAfterwards, 1858 TransitionsBefore, 1858 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, 219 PlacesBefore, 217 PlacesAfterwards, 1770 TransitionsBefore, 1769 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, 223 PlacesBefore, 223 PlacesAfterwards, 1733 TransitionsBefore, 1733 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, 231 PlacesBefore, 231 PlacesAfterwards, 1861 TransitionsBefore, 1861 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, 242 PlacesBefore, 242 PlacesAfterwards, 1933 TransitionsBefore, 1933 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.2s, 246 PlacesBefore, 230 PlacesAfterwards, 1554 TransitionsBefore, 1550 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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, 236 PlacesBefore, 236 PlacesAfterwards, 1303 TransitionsBefore, 1303 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, 244 PlacesBefore, 244 PlacesAfterwards, 1423 TransitionsBefore, 1423 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, 249 PlacesBefore, 249 PlacesAfterwards, 1416 TransitionsBefore, 1416 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, 255 PlacesBefore, 253 PlacesAfterwards, 1329 TransitionsBefore, 1328 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, 252 PlacesBefore, 252 PlacesAfterwards, 1301 TransitionsBefore, 1301 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, 261 PlacesBefore, 261 PlacesAfterwards, 1379 TransitionsBefore, 1379 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, 267 PlacesBefore, 267 PlacesAfterwards, 1335 TransitionsBefore, 1335 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, 274 PlacesBefore, 272 PlacesAfterwards, 1239 TransitionsBefore, 1238 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, 263 PlacesBefore, 263 PlacesAfterwards, 1156 TransitionsBefore, 1156 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, 1127 TransitionsBefore, 1127 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, 280 PlacesBefore, 280 PlacesAfterwards, 1085 TransitionsBefore, 1085 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, 284 PlacesBefore, 284 PlacesAfterwards, 941 TransitionsBefore, 941 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, 294 PlacesBefore, 294 PlacesAfterwards, 977 TransitionsBefore, 977 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, 295 PlacesBefore, 295 PlacesAfterwards, 911 TransitionsBefore, 911 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: 2.0s, 266 PlacesBefore, 245 PlacesAfterwards, 763 TransitionsBefore, 762 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, 254 PlacesBefore, 254 PlacesAfterwards, 1692 TransitionsBefore, 1692 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, 264 PlacesBefore, 262 PlacesAfterwards, 1604 TransitionsBefore, 1603 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, 268 PlacesBefore, 268 PlacesAfterwards, 1460 TransitionsBefore, 1460 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, 273 PlacesBefore, 273 PlacesAfterwards, 1440 TransitionsBefore, 1440 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, 281 PlacesBefore, 281 PlacesAfterwards, 1424 TransitionsBefore, 1424 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, 288 PlacesBefore, 280 PlacesAfterwards, 1170 TransitionsBefore, 1168 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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, 290 PlacesBefore, 290 PlacesAfterwards, 1139 TransitionsBefore, 1139 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, 299 PlacesBefore, 299 PlacesAfterwards, 1217 TransitionsBefore, 1217 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, 303 PlacesBefore, 303 PlacesAfterwards, 1185 TransitionsBefore, 1185 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, 313 PlacesBefore, 311 PlacesAfterwards, 1229 TransitionsBefore, 1227 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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, 307 PlacesBefore, 307 PlacesAfterwards, 1206 TransitionsBefore, 1206 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, 298 PlacesBefore, 298 PlacesAfterwards, 995 TransitionsBefore, 995 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, 305 PlacesBefore, 304 PlacesAfterwards, 938 TransitionsBefore, 937 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: 5.2s, 314 PlacesBefore, 313 PlacesAfterwards, 973 TransitionsBefore, 972 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, 320 PlacesBefore, 320 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, 278 PlacesBefore, 278 PlacesAfterwards, 762 TransitionsBefore, 762 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, 287 PlacesBefore, 287 PlacesAfterwards, 1692 TransitionsBefore, 1692 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, 296 PlacesBefore, 294 PlacesAfterwards, 1604 TransitionsBefore, 1603 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, 300 PlacesBefore, 300 PlacesAfterwards, 1460 TransitionsBefore, 1460 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, 307 PlacesBefore, 307 PlacesAfterwards, 1451 TransitionsBefore, 1451 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, 314 PlacesBefore, 305 PlacesAfterwards, 1137 TransitionsBefore, 1135 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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, 316 PlacesBefore, 316 PlacesAfterwards, 1161 TransitionsBefore, 1161 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, 324 PlacesBefore, 324 PlacesAfterwards, 1247 TransitionsBefore, 1247 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, 330 PlacesBefore, 330 PlacesAfterwards, 1211 TransitionsBefore, 1211 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, 335 PlacesBefore, 333 PlacesAfterwards, 1153 TransitionsBefore, 1152 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, 337 PlacesBefore, 337 PlacesAfterwards, 1144 TransitionsBefore, 1144 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, 327 PlacesBefore, 327 PlacesAfterwards, 1059 TransitionsBefore, 1059 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, 335 PlacesBefore, 335 PlacesAfterwards, 1002 TransitionsBefore, 1002 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, 1042 TransitionsBefore, 1042 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, 343 PlacesBefore, 343 PlacesAfterwards, 879 TransitionsBefore, 879 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: 3.7s, 324 PlacesBefore, 311 PlacesAfterwards, 698 TransitionsBefore, 697 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, 320 PlacesBefore, 320 PlacesAfterwards, 1425 TransitionsBefore, 1425 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, 330 PlacesBefore, 329 PlacesAfterwards, 1784 TransitionsBefore, 1783 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, 336 PlacesBefore, 336 PlacesAfterwards, 1640 TransitionsBefore, 1640 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, 343 PlacesBefore, 343 PlacesAfterwards, 1647 TransitionsBefore, 1647 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, 352 PlacesBefore, 351 PlacesAfterwards, 1393 TransitionsBefore, 1392 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, 359 PlacesBefore, 350 PlacesAfterwards, 1025 TransitionsBefore, 1023 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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, 359 PlacesBefore, 359 PlacesAfterwards, 981 TransitionsBefore, 981 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, 366 PlacesBefore, 366 PlacesAfterwards, 1021 TransitionsBefore, 1021 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, 1088 TransitionsBefore, 1088 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, 379 PlacesBefore, 379 PlacesAfterwards, 1080 TransitionsBefore, 1080 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, 385 PlacesBefore, 385 PlacesAfterwards, 973 TransitionsBefore, 973 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, 382 PlacesBefore, 380 PlacesAfterwards, 951 TransitionsBefore, 950 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, 375 PlacesBefore, 375 PlacesAfterwards, 864 TransitionsBefore, 864 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, 381 PlacesBefore, 381 PlacesAfterwards, 852 TransitionsBefore, 852 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: 4.4s, 365 PlacesBefore, 351 PlacesAfterwards, 715 TransitionsBefore, 714 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, 359 PlacesBefore, 358 PlacesAfterwards, 1488 TransitionsBefore, 1487 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, 364 PlacesBefore, 364 PlacesAfterwards, 1324 TransitionsBefore, 1324 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, 371 PlacesBefore, 367 PlacesAfterwards, 1025 TransitionsBefore, 1023 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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, 375 PlacesBefore, 375 PlacesAfterwards, 981 TransitionsBefore, 981 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, 382 PlacesBefore, 382 PlacesAfterwards, 1021 TransitionsBefore, 1021 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, 389 PlacesBefore, 389 PlacesAfterwards, 1013 TransitionsBefore, 1013 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, 395 PlacesBefore, 393 PlacesAfterwards, 955 TransitionsBefore, 954 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, 397 PlacesBefore, 397 PlacesAfterwards, 946 TransitionsBefore, 946 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, 861 TransitionsBefore, 861 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, 397 PlacesBefore, 397 PlacesAfterwards, 833 TransitionsBefore, 833 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: 161]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (10states, 0/36 universal loopers) in iteration 132,while PetriNetUnfolder was constructing finite prefix that currently has 321199 conditions, 2417 events (1327/2416 cut-off events. For 4748/4748 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14262 event pairs, 24 based on Foata normal form. 0/2461 useless extension candidates. Maximal degree in co-relation 273698. Up to 2417 conditions per place.). - TimeoutResultAtElement [Line: 155]: 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 (10states, 0/36 universal loopers) in iteration 132,while PetriNetUnfolder was constructing finite prefix that currently has 321199 conditions, 2417 events (1327/2416 cut-off events. For 4748/4748 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14262 event pairs, 24 based on Foata normal form. 0/2461 useless extension candidates. Maximal degree in co-relation 273698. Up to 2417 conditions per place.). - TimeoutResultAtElement [Line: 153]: 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 (10states, 0/36 universal loopers) in iteration 132,while PetriNetUnfolder was constructing finite prefix that currently has 321199 conditions, 2417 events (1327/2416 cut-off events. For 4748/4748 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14262 event pairs, 24 based on Foata normal form. 0/2461 useless extension candidates. Maximal degree in co-relation 273698. Up to 2417 conditions per place.). - TimeoutResultAtElement [Line: 154]: 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 (10states, 0/36 universal loopers) in iteration 132,while PetriNetUnfolder was constructing finite prefix that currently has 321199 conditions, 2417 events (1327/2416 cut-off events. For 4748/4748 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14262 event pairs, 24 based on Foata normal form. 0/2461 useless extension candidates. Maximal degree in co-relation 273698. Up to 2417 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 201 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 803.1s, OverallIterations: 132, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 636.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21144 SdHoareTripleChecker+Valid, 36.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21144 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 30.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 1163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 70454 IncrementalHoareTripleChecker+Invalid, 71617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1163 mSolverCounterUnsat, 45 mSDtfsCounter, 70454 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1964 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 1924 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3157 ImplicationChecksByTransitivity, 29.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=389740occurred in iteration=108, InterpolantAutomatonStates: 1409, 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.2s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 84.0s InterpolantComputationTime, 3878 NumberOfCodeBlocks, 3878 NumberOfCodeBlocksAsserted, 132 NumberOfCheckSat, 3746 ConstructedInterpolants, 0 QuantifiedInterpolants, 96213 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 132 InterpolantComputations, 132 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